Overview
- Includes supplementary material: sn.pub/extras
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10236)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: CIAC 2017.
Buy print copy
About this book
The 36 revised full papers were carefully reviewed and selected from 90 submissions and are presented together with 3 abstracts of invited talks and a paper to the 70th birthday of Stathis Zachos. The papers present original research in the theory and applications of algorithms and computational complexity.
Similar content being viewed by others
Keywords
- algorithm engineering
- computational complexity
- discrete optimization
- parallel and distributed algorithms
- theoretical computer science
- algorithmic aspects of communication networks
- algorithmic game theory
- algorithms
- approximation algorithms
- complexity theory
- computational geometry
- data structures
- evolutionarily stable strategies
- exact and parameterized computation
- game theory
- graph algorithms and graph drawing
- inapproximability
- online and streaming algorithms
- randomized algorithms
- search algorithm
- algorithm analysis and problem complexity
Table of contents (39 papers)
-
Extended Abstracts
-
Regular Papers
Other volumes
-
Algorithms and Complexity
Editors and Affiliations
Bibliographic Information
Book Title: Algorithms and Complexity
Book Subtitle: 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings
Editors: Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-57586-5
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2017
Softcover ISBN: 978-3-319-57585-8Published: 15 April 2017
eBook ISBN: 978-3-319-57586-5Published: 12 April 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XX, 486
Number of Illustrations: 59 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Data Structures