000 05208nam a22006735i 4500
001 978-3-540-46521-8
003 DE-He213
005 20240423132432.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540465218
_9978-3-540-46521-8
024 7 _a10.1007/3-540-46521-9
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aAlgorithms and Complexity
_h[electronic resource] :
_b4th Italian Conference, CIAC 2000 Rome, Italy, March 1-3, 2000 Proceedings /
_cedited by Giancarlo Bongiovanni, Giorgio Gambosi, Rosella Petreschi.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aVIII, 324 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1767
505 0 _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.
520 _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.
650 0 _aComputer programming.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aAlgorithms.
650 0 _aComputer science.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 1 4 _aProgramming Techniques.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aAlgorithms.
650 2 4 _aTheory of Computation.
650 2 4 _aData Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aBongiovanni, Giancarlo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGambosi, Giorgio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPetreschi, Rosella.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540671596
776 0 8 _iPrinted edition:
_z9783662171813
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1767
856 4 0 _uhttps://doi.org/10.1007/3-540-46521-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187718
_d187718