Algorithms and Complexity
10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings
Seiten
2017
|
1st ed. 2017
Springer International Publishing (Verlag)
978-3-319-57585-8 (ISBN)
Springer International Publishing (Verlag)
978-3-319-57585-8 (ISBN)
This book constitutes the refereed conference proceedings of the 10th International Conference on Algorithms and Complexity, CIAC 2017, held in Athens, Greece, in May 2017.
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.
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.
Erscheinungsdatum | 16.05.2017 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XX, 486 p. 59 illus. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 771 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | Algorithm analysis and problem complexity • Algorithm Engineering • algorithmic aspects of communication networks • algorithmic game theory • algorithms • algorithms and data structures • Applications • approximation algorithms • Complexity theory • Computational Complexity • Computational Geometry • Computer Science • conference proceedings • data structures • Discrete Mathematics • Discrete mathematics in computer science • Discrete Optimization • evolutionarily stable strategies • exact and parameterized computation • Game Theory • graph algorithms and graph drawing • inapproximability • Informatics • Maths for computer scientists • online and streaming algorithms • parallel and distributed algorithms • randomized algorithms • Research • Search Algorithm • theoretical computer science |
ISBN-10 | 3-319-57585-6 / 3319575856 |
ISBN-13 | 978-3-319-57585-8 / 9783319575858 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
Lehmanns Media (Verlag)
39,99 €
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
29,99 €
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99 €