Combinatorial Algorithms

28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers
1. Auflage 2018
ISBN: 978-3-319-78824-1
Verlag: Springer International Publishing

Buch, Englisch, Band 10765, 434 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 674 g

Reihe: Lecture Notes in Computer Science

This book constitutes the refereed post-conference proceedings of the 28th International Workshopon Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named:  approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms.

Zielgruppe

Research

Autoren/Hrsg.

Brankovic, Ljiljana

Smyth, William F.

Ryan, Joe

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

Approximation algorithms and hardness.- Computational complexity.- Computational geometry.- Graphs and combinatorics.- Graph colourings, labellings and power domination.- Heuristics.- Mixed integer programming.- Polynomial algorithms.- Privacy.- String algorithms.