Algorithms and complexity : 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings /
Saved in:
| Meeting name: | International Conference on Algorithms and Complexity (10th : 2017 : Athens, Greece) |
|---|---|
| Imprint: | Cham : Springer, 2017. |
| Description: | 1 online resource (XX, 486 pages) : illustrations |
| Language: | English |
| Series: | Lecture Notes in Computer Science, 0302-9743 ; 10236 Lecture notes in computer science ; 10236. |
| Subject: | |
| Format: | E-Resource Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/11274299 |
MARC
| LEADER | 00000cam a2200000Mi 4500 | ||
|---|---|---|---|
| 001 | 11274299 | ||
| 006 | m o d | ||
| 007 | cr nn||||mamaa | ||
| 008 | 170413s2017 sz a ob 100 0 eng d | ||
| 005 | 20240702144314.9 | ||
| 015 | |a GBB8O3213 |2 bnb | ||
| 016 | 7 | |a 019182620 |2 Uk | |
| 019 | |a 985688405 |a 985876574 |a 986129998 |a 986228527 |a 986376816 |a 986649883 |a 986930209 |a 993697060 |a 1007229426 |a 1007244843 |a 1066192256 |a 1083017120 |a 1132588843 | ||
| 020 | |a 9783319575865 | ||
| 020 | |a 3319575864 | ||
| 020 | |z 9783319575858 | ||
| 020 | |z 3319575856 | ||
| 024 | 7 | |a 10.1007/978-3-319-57586-5 |2 doi | |
| 035 | |a (OCoLC)988387501 |z (OCoLC)985688405 |z (OCoLC)985876574 |z (OCoLC)986129998 |z (OCoLC)986228527 |z (OCoLC)986376816 |z (OCoLC)986649883 |z (OCoLC)986930209 |z (OCoLC)993697060 |z (OCoLC)1007229426 |z (OCoLC)1007244843 |z (OCoLC)1066192256 |z (OCoLC)1083017120 |z (OCoLC)1132588843 | ||
| 035 | 9 | |a (OCLCCM-CC)988387501 | |
| 037 | |a com.springer.onix.9783319575865 |b Springer Nature | ||
| 040 | |a AZU |b eng |e rda |e pn |c AZU |d OCLCO |d UPM |d LGG |d YDX |d GW5XE |d OCLCF |d UAB |d ESU |d DKDLA |d NJR |d IOG |d COO |d MERER |d OCLCQ |d AUD |d W2U |d OCLCQ |d OCL |d U3W |d CAUOI |d OCLCQ |d CRU |d VT2 |d OCLCQ |d TFW |d OCLCQ |d WYU |d EBLCP |d LEAUB |d CEF |d OH1 |d OCLCQ |d UKMGB |d UX1 |d OCL |d OCLCO |d OCLCQ |d UBY |d OCLCQ |d OCLCO |d OCL |d UKAHL | ||
| 049 | |a MAIN | ||
| 050 | 4 | |a QA76.9.A43 |b I58 2017 | |
| 072 | 7 | |a UMB |2 bicssc | |
| 072 | 7 | |a COM051300 |2 bisacsh | |
| 111 | 2 | |a International Conference on Algorithms and Complexity |n (10th : |d 2017 : |c Athens, Greece) | |
| 245 | 1 | 0 | |a Algorithms and complexity : |b 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings / |c edited by Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos. |
| 264 | 1 | |a Cham : |b Springer, |c 2017. | |
| 300 | |a 1 online resource (XX, 486 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file | ||
| 347 | |b PDF | ||
| 490 | 1 | |a Lecture Notes in Computer Science, |x 0302-9743 ; |v 10236 | |
| 520 | |a This book constitutes the refereed conference proceedings of the 10th International Conference on Algorithms and Complexity, CIAC 2017, held in Athens, Greece, in May 2017. The 36 revised full papers were carefully reviewed and selected from 90 submissions and are presented together with 3 abstracts of invited talks and a paper to the 70th birthday of Stathis Zachos. The papers present original research in the theory and applications of algorithms and computational complexity. | ||
| 504 | |a Includes bibliographical references and author index. | ||
| 505 | 0 | |a Intro -- Preface -- Organization -- Invited Talks -- TFNP: An Update -- 2-Edge and 2-Vertex Connectivity in Directed Graphs -- New Algorithmic Results for Bin Packing and Scheduling -- Contents -- Extended Abstracts -- TFNP: An Update -- 1 Introduction -- 2 Recent Developments -- 3 Open Problems -- References -- New Algorithmic Results for Bin Packing and Scheduling -- 1 Introduction -- 2 Scheduling Problems -- 2.1 Known Results -- 2.2 New Results -- 3 Bin Packing -- 3.1 Known Results -- 3.2 New Results -- References -- Regular Papers -- Scheduling Maintenance Jobs in Networks | |
| 505 | 8 | |a 1 Introduction -- 2 Preemptive Scheduling -- 3 Non-preemptive Scheduling -- 4 Power of Preemption -- 5 Mixed Scheduling -- 6 Conclusion -- References -- Paths to Trees and Cacti -- 1 Introduction -- 2 Preliminaries -- 3 Kernel for Bounded Out-Tree Contraction -- 4 Kernel Lower Bounds -- 4.1 Lower bound for Bounded OTC -- References -- Temporal Flows in Temporal Networks -- 1 Introduction and Motivation -- 1.1 Our Model, the Problem, and Our Results -- 1.2 Previous Work -- 1.3 Formal Definitions -- 2 LP for the MTF Problem with or Without Bounded Buffers | |
| 505 | 8 | |a 3 Temporal Networks with Unbounded Buffers at Nodes -- 3.1 Basic Remarks -- 3.2 The Time-Extended Flow Network and Its Simplification -- 4 Mixed Temporal Networks and Their Hardness -- 4.1 Temporal Networks with Random Availabilities that are Flow Cutters -- 4.2 The Complexity of Computing the Expected Maximum Temporal Flow -- References -- Completeness Results for Counting Problems with Easy Decision -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 3 #Monotone-Circuit-Sat is TotP -complete Under Karp Reductions -- 3.1 #Monotone-Circuit-Sat is TotP -hard | |
| 505 | 8 | |a 3.2 #Monotone-Circuit-Sat Is in TotP -- 4 More TotP -complete Problems -- 5 Discussion on Approximability Implications -- 6 Conclusion and Open Problems -- References -- Tracking Paths -- 1 Introduction -- 2 Hardness Results -- 3 Tracking Paths in Planar Graphs -- 4 Catching the Intruder -- References -- On the Complexity of Finding a Potential Community -- 1 Introduction -- 2 Preliminaries -- 3 Complexity Jump from Planar Graphs to Apex Graphs -- 4 Graph Classes with Polynomial-Time Algorithms -- 5 NP-hardness and Non-approximability -- 6 Conclusion -- References | |
| 505 | 8 | |a Improved Lower Bounds for Graph Embedding Problems -- 1 Introduction -- 2 Preliminaries -- 3 String Crafting and Orthogonal Vector Crafting -- 4 Lower Bounds for Graph Embedding Problems -- 5 Tree and Path Decompositions with Few Bags -- 6 Intervalizing Coloured Graphs -- 7 Conclusions -- References -- Collaboration Without Communication: Evacuating Two Robots from a Disk -- 1 Introduction -- 1.1 Related Work -- 1.2 Model -- 1.3 Notation -- 2 Determining the Worst-Case Placement of the Exit -- 3 Evacuating from a Disk -- 3.1 The Algorithm A(y, d) | |
| 650 | 0 | |a Computer algorithms |v Congresses. | |
| 650 | 0 | |a Computational complexity |v Congresses. | |
| 650 | 7 | |a Discrete mathematics. |2 bicssc | |
| 650 | 7 | |a Algorithms & data structures. |2 bicssc | |
| 650 | 7 | |a Computers |x Data Processing. |2 bisacsh | |
| 650 | 7 | |a Computers |x Data Modeling & Design. |2 bisacsh | |
| 650 | 7 | |a Computers |x Programming |x Algorithms. |2 bisacsh | |
| 650 | 7 | |a Computer algorithms. |2 fast |0 (OCoLC)fst00872010 | |
| 650 | 7 | |a Computational complexity. |2 fast |0 (OCoLC)fst00871991 | |
| 650 | 7 | |a Data structures (Computer science) |2 fast |0 (OCoLC)fst00887978 | |
| 650 | 7 | |a Algorithms. |2 fast |0 (OCoLC)fst00805020 | |
| 650 | 7 | |a Computer science. |2 fast |0 (OCoLC)fst00872451 | |
| 650 | 7 | |a Computer science |x Mathematics. |2 fast |0 (OCoLC)fst00872460 | |
| 655 | 4 | |a Electronic books. | |
| 655 | 7 | |a Conference papers and proceedings. |2 fast |0 (OCoLC)fst01423772 | |
| 700 | 1 | |a Fotakis, Dimitris, |e editor. | |
| 700 | 1 | |a Pagourtzis, Aris, |e editor. | |
| 700 | 1 | |a Paschos, Vangelis Th, |e editor. | |
| 776 | 0 | 8 | |i Printed edition: |z 9783319575858 |
| 830 | 0 | |a Lecture notes in computer science ; |v 10236. |x 0302-9743 |0 http://id.loc.gov/authorities/names/n42015162 | |
| 903 | |a HeVa | ||
| 929 | |a oclccm | ||
| 999 | f | f | |i b84dd5ff-9bf2-556c-9048-6dc320da1339 |s 800b7f5b-7f64-5410-a89a-4688333c5902 |
| 928 | |t Library of Congress classification |a QA76.9.A43 I58 2017 |l Online |c UC-FullText |u https://link.springer.com/10.1007/978-3-319-57586-5 |z Springer Nature |g ebooks |i 12546367 | ||