Combinatorial Algorithms [electronic resource] : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /

Contributor(s):

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 10765Publisher: Cham : Springer International Publishing : Imprint: Springer, 2018Edition: 1st ed. 2018Description: XII, 434 p. 80 illus. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783319788258

Subject(s):

Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:

004.0151 23

LOC classification:

QA76.9.M35
QA297.4

Online resources:

Click here to access online

Contents:

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.

In: Springer Nature eBookSummary: This book constitutes the refereed post-conference proceedings of the 28th International Workshop on 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

This book constitutes the refereed post-conference proceedings of the 28th International Workshop on 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.

There are no comments on this title.

to post a comment.