27th Annual European Symposium on Algorithms: ESA 2019, September 9–11, 2019, Munich/Garching, Germany Edited by
Gespeichert in:
Bibliographische Detailangaben
Körperschaft: ESA München (VerfasserIn)
Weitere beteiligte Personen: Bender, Michael A. (HerausgeberIn), Svensson, Ola Nils Anders 1981- (HerausgeberIn), Herman, Grzegorrz (HerausgeberIn)
Format: Elektronisch Tagungsbericht E-Book
Sprache:Englisch
Veröffentlicht: Saarbrücken/Wadern Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing September, 2019
Schriftenreihe:LIPIcs - Leibniz International Proceedings in Informatics Vol. 144
Schlagwörter:
Applied computing, Transportation; Computing methodologies, Algebraic algorithms; Hardware, External storage; Human-centered computing, Graph drawings; Information systems, Data structures; Mathematics of computing, Algebraic topology; Approximation algorithms; Combinatorial algorithms; Combinatorial optimization, Graph algorithms ; Graph theory;, Graph algorithms; Graphs and surfaces; Mathematics of of computing, Graph Theory; Integer programming; Linear programming; Network flows; Network optimization; Paths and connectivity problems; Probabilistic algorithms; Probability and statistics, Semidefinite programming; Spectra of graphs; Networks, Network algorithms; Networks, Routing protocols; Theory of computation, Algorithm design techniques; Algorithmic game theory and mechanism design; Algorithmic mechanism design; Approximation algorithms analysis; Computational complexity and cryptography; Computational geometry; Convex optimization; Data compression; Data structures design and analysis; Design and analysis of algorithms; Dynamic graph algorithms; Exact and approximate computation of equilibria; Facility location and clustering; Fixed parameter tractability; Graph algorithms analysis; Interactive proof systems; Linear programming; Lower bounds and information complexity; Massively parallel algorithms; Mathematical optimization; Nearest neighboralgorithms; Network flows; Numeric approximation algorithms; Online algorithms; Packing and covering problems; Parallel algorithms; Parameterized complexity and exact algorithms; Pattern matching; Problems, reductions and completeness; Quantum computation theory; Quantum query complexity; Routing and network design problems; Scheduling algorithms; Shortest paths; Sketching and sampling; Sparsification and spanners; Streaming, sublinear and near linear time algorithms; Submodular optimization and polymatroids; Unsupervised learning and clustering; W hierarchy
Links:https://nbn-resolving.org/urn:nbn:de:0030-drops-113004
http://d-nb.info/1195061447/34
http://www.dagstuhl.de/dagpub/978-3-95977-124-5
http://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol144-esa2019-complete.pdf
Umfang:1 Online-Ressource Illustrationen
Format:Archivierung/Langzeitarchivierung gewährleistet
ISBN:9783959771245