logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Combinatorial Algorithms 29th International Workshop Iwoca 2018 Singapore July 1619 2018 Proceedings 1st Ed Ljiljana Brankovic

  • SKU: BELL-7150252
Combinatorial Algorithms 29th International Workshop Iwoca 2018 Singapore July 1619 2018 Proceedings 1st Ed Ljiljana Brankovic
$ 31.00 $ 45.00 (-31%)

4.8

34 reviews

Combinatorial Algorithms 29th International Workshop Iwoca 2018 Singapore July 1619 2018 Proceedings 1st Ed Ljiljana Brankovic instant download after payment.

Publisher: Springer International Publishing
File Extension: PDF
File size: 10.96 MB
Author: Ljiljana Brankovic, Joe Ryan, William F. Smyth
ISBN: 9783319788241, 9783319788258, 3319788248, 3319788256
Language: English
Year: 2018
Edition: 1st ed.

Product desciption

Combinatorial Algorithms 29th International Workshop Iwoca 2018 Singapore July 1619 2018 Proceedings 1st Ed Ljiljana Brankovic by Ljiljana Brankovic, Joe Ryan, William F. Smyth 9783319788241, 9783319788258, 3319788248, 3319788256 instant download after payment.

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.

NB: wrong cover

Related Products