LEADER 05453nam 22008655 450 001 9910484492703321 005 20251226195809.0 010 $a1-280-38905-2 010 $a9786613566973 010 $a3-642-15781-5 024 7 $a10.1007/978-3-642-15781-3 035 $a(CKB)2670000000045104 035 $a(SSID)ssj0000446290 035 $a(PQKBManifestationID)11296937 035 $a(PQKBTitleCode)TC0000446290 035 $a(PQKBWorkID)10495778 035 $a(PQKB)11022708 035 $a(DE-He213)978-3-642-15781-3 035 $a(MiAaPQ)EBC3065725 035 $a(PPN)149024525 035 $a(BIP)32107251 035 $a(EXLCZ)992670000000045104 100 $a20100901d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms -- ESA 2010, Part II $e18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings /$fedited by Mark de Berg, Ulrich Meyer 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XVII, 245 p. 28 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6347 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-15780-7 320 $aIncludes bibliographical references and index. 327 $aInvited Talk -- Data Structures: Time, I/Os, Entropy, Joules! -- Session 8a -- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness -- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games -- Combinatorial Auctions with Verification Are Tractable -- How to Allocate Goods in an Online Market? -- Session 8b -- Fréchet Distance of Surfaces: Some Simple Hard Cases -- Geometric Algorithms for Private-Cache Chip Multiprocessors -- Volume in General Metric Spaces -- Shortest Cut Graph of a Surface with Prescribed Vertex Set -- Session 9a -- Induced Matchings in Subcubic Planar Graphs -- Robust Matchings and Matroid Intersections -- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties -- Strongly Stable Assignment -- Session 9b -- Data Structures for Storing Small Sets in the Bitprobe Model -- On Space Efficient Two Dimensional Range Minimum Data Structures -- Pairing Heaps with Costless Meld -- Top-k Ranked Document Search in General Text Databases -- Best-Paper Session -- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time -- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings -- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. 330 $aThis volume contains the 69 papers presented at the 16th Annual European Symposium on Algorithms (ESA 2010), held in Liverpool during September 6-8, 2010, including three papers by the distinguished invited speakers Artur Czumaj, Herbert Edelsbrunner, and Paolo Ferragina. ESA 2010 was organized as a part of ALGO 2010, which also included the 10th Workshop on Algorithms in Bioinformatics (WABI), the 8th Workshop on Approximation and Online Algorithms (WAOA), and the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS). The European Symposium on Algorithms covers research in the design, use, andanalysisofe'cientalgorithmsanddata structures.As inpreviousyears,the symposium had two tracks: the Design and Analysis Track and the Engineering and Applications Track, each with its own Program Committee. In total 245 papers adhering to the submission guidelines were submitted. Each paper was reviewed by three or four referees. Based on the reviews and the often extensive electronicdiscussionsfollowingthem, thecommittees selected 66papersintotal: 56 (out of 206) to the Design and Analysis Track and 10 (out of 39) to the Engineering andApplicationstrack.We believethat thesepaperstogethermade up a strong and varied program, showing the depth and breadth of current algorithms research. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6347 606 $aComputer programming 606 $aAlgorithms 606 $aComputer networks 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aNumerical analysis 606 $aProgramming Techniques 606 $aAlgorithms 606 $aComputer Communication Networks 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 606 $aNumerical Analysis 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer networks. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aNumerical analysis. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aComputer Communication Networks. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aNumerical Analysis. 676 $a005.11 701 $aBerg$b Mark de$0534961 701 $aMeyer$b Ulrich$f1971-$01757055 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484492703321 996 $aAlgorithms -- ESA 2010, Part II$94522611 997 $aUNINA LEADER 01056nlm 2200289Ia 450 001 996639471303316 005 20250121095501.0 100 $a19840529d1700---- uy | 101 0 $aeng 102 $aUK 135 $adrcnu 200 1 $aMerlinus Anglicus junior, or, The starry messenger from the year of our redemption, 1700$eand from the creation according to Sacred Writ, 5649, being bissextile, or leap-year ...$fby Henry Coley 205 $a29. ristampa 210 1 $aLondon$cPrinted by John Heptinstall for the Company of Stationers$d1700 215 $aTesto elettronico (PDF) ([46] p.) 230 $aBase dati testuale 300 $aInclude tabelle 300 $aRiproduzione dell'originale nella Biblioteca di Huntington 606 0 $aAstrologia$2BNCF 676 $a133.5 700 1$aCOLEY,$bHenry$f1633-1695?$01001031 801 0$aIT$bcba$cREICAT 912 $a996639471303316 959 $aEB 969 $aER 996 $aMerlinus Anglicus junior, or, The starry messenger from the year of our redemption, 1700$92317616 997 $aUNISA