My Account Log in

1 option

Combinatorial Algorithms : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers / edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Brankovic, Ljiljana, Editor.
Ryan, Joe, Editor.
Smyth, William F., Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 10765
Theoretical Computer Science and General Issues, 2512-2029 ; 10765
Language:
English
Subjects (All):
Computer science-Mathematics.
Discrete mathematics.
Algorithms.
Artificial intelligence-Data processing.
Artificial intelligence.
Numerical analysis.
Data protection.
Discrete Mathematics in Computer Science.
Data Science.
Artificial Intelligence.
Numerical Analysis.
Data and Information Security.
Local Subjects:
Discrete Mathematics in Computer Science.
Algorithms.
Data Science.
Artificial Intelligence.
Numerical Analysis.
Data and Information Security.
Physical Description:
1 online resource (XII, 434 pages) : 80 illustrations
Edition:
1st ed. 2018.
Contained In:
Springer Nature eBook
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2018.
System Details:
text file PDF
Summary:
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.
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.
Other Format:
Printed edition:
ISBN:
978-3-319-78825-8
9783319788258
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account