Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11485)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): CIAC: International Conference on Algorithms and Complexity
Conference proceedings info: CIAC 2019.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (30 papers)
-
Front Matter
About this book
This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019.
The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.
Keywords
- approximation algorithms
- artificial intelligence
- computer networks
- game theory
- graph g
- graph theory
- polynomial approximation
- polynomial-time algorithms
- problem solving
- scheduling algorithms
- scheduling problem
- telecommunication networks
- vertex set
- algorithm analysis and problem complexity
- data structures
Editors and Affiliations
-
University of Bergen, Bergen, Norway
Pinar Heggernes
Bibliographic Information
Book Title: Algorithms and Complexity
Book Subtitle: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings
Editors: Pinar Heggernes
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-17402-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2019
Softcover ISBN: 978-3-030-17401-9Published: 06 April 2019
eBook ISBN: 978-3-030-17402-6Published: 20 May 2019
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 378
Number of Illustrations: 241 b/w illustrations, 33 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Data Structures, Arithmetic and Logic Structures