Algorithms and Computation
25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings
Seiten
2014
|
2014
Springer International Publishing (Verlag)
978-3-319-13074-3 (ISBN)
Springer International Publishing (Verlag)
978-3-319-13074-3 (ISBN)
This book constitutes the refereed proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, held in Jeonju, Korea, in December 2014.
The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.
The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.
Computational geometry.- Combinatorial optimization.- Graph algorithms.- Enumeration, matching and assignment.- Data structures and algorithms.- Fixed-parameter tractable algorithms.- Scheduling algorithms.- Computational complexity.- Approximation algorithms, graph theory and algorithms.- Online and approximation algorithms.- Network and scheduling algorithms.
| Erscheint lt. Verlag | 20.11.2014 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XXII, 781 p. 144 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 1211 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • algorithmic game theory • algorithms • Applications • Approximation • approximation algorithms • combinatorial optimization • Computational Biology • Computational Complexity • Computational Geometry • Computer Science • conference proceedings • cryptography • data structures • distributed algorithms • experimental algorithms • Graph Algorithms • Graph Drawing • Informatics • internet algorithms • online algorithms • Parallel Algorithms • polynomial time • Quantum Computing • randomized algorithms • Research |
| ISBN-10 | 3-319-13074-9 / 3319130749 |
| ISBN-13 | 978-3-319-13074-3 / 9783319130743 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
Lehmanns Media (Verlag)
CHF 55,95
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15
