LEADER 06062nam 22008055 450 001 9910143637803321 005 20200702172454.0 010 $a3-540-46521-9 024 7 $a10.1007/3-540-46521-9 035 $a(CKB)1000000000211212 035 $a(SSID)ssj0000321199 035 $a(PQKBManifestationID)11231224 035 $a(PQKBTitleCode)TC0000321199 035 $a(PQKBWorkID)10262621 035 $a(PQKB)10661451 035 $a(DE-He213)978-3-540-46521-8 035 $a(MiAaPQ)EBC3072725 035 $a(PPN)155191292 035 $a(EXLCZ)991000000000211212 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Complexity $e4th Italian Conference, CIAC 2000 Rome, Italy, March 1-3, 2000 Proceedings /$fedited by Giancarlo Bongiovanni, Giorgio Gambosi, Rosella Petreschi 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (VIII, 324 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1767 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67159-5 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Presentations -- On Salesmen, Repairmen, Spiders, and Other Traveling Agents -- Computing a Diameter-Constrained Minimum Spanning Tree in Parallel -- Algorithms for a Simple Point Placement Problem -- Duality in ATM Layout Problems -- Regular Presentations -- The Independence Number of Random Interval Graphs -- Online Strategies for Backups -- Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem -- Semantical Counting Circuits -- The Hardness of Placing Street Names in a Manhattan Type Map -- Labeling Downtown -- The Online Dial-a-Ride Problem under Reasonable Load -- The Online-TSP against Fair Adversaries -- QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms -- Triangulations without Minimum-Weight Drawing -- Faster Exact Solutions for Max2Sat -- Dynamically Maintaining the Widest k-Dense Corridor -- Reconstruction of Discrete Sets from Three or More X-Rays -- Modified Binary Searching for Static Tables -- An Efficient Algorithm for the Approximate Median Selection Problem -- Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes -- Group Updates for Bed-Black Trees -- Approximating SVP ? to within Almost-Polynomial Factors Is NP-Hard -- Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems -- On the Lovász Number of Certain Circulant Graphs -- Speeding Up Pattern Matching by Text Compression. 330 $aThe papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invitation. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1767 606 $aComputer programming 606 $aData structures (Computer science) 606 $aAlgorithms 606 $aComputers 606 $aComputer science?Mathematics 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aComputer programming. 615 0$aData structures (Computer science) 615 0$aAlgorithms. 615 0$aComputers. 615 0$aComputer science?Mathematics. 615 14$aProgramming Techniques. 615 24$aData Structures and Information Theory. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aData Structures. 615 24$aDiscrete Mathematics in Computer Science. 676 $a511.8 702 $aBongiovanni$b Giancarlo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGambosi$b Giorgio$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPetreschi$b Rosella$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aItalian Conference on Algorithms and Complexity 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143637803321 996 $aAlgorithms and Complexity$93241163 997 $aUNINA