000 | 03626nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-642-15781-3 | ||
003 | DE-He213 | ||
005 | 20240423125733.0 | ||
007 | cr nn 008mamaa | ||
008 | 100901s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642157813 _9978-3-642-15781-3 |
||
024 | 7 |
_a10.1007/978-3-642-15781-3 _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 -- ESA 2010, Part II _h[electronic resource] : _b18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings / _cedited by Mark de Berg, Ulrich Meyer. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aXVII, 245 p. 28 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6347 |
|
505 | 0 | _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. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer networks . | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aComputer graphics. | |
650 | 0 | _aNumerical analysis. | |
650 | 1 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aNumerical Analysis. |
700 | 1 |
_ade Berg, Mark. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aMeyer, Ulrich. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642157806 |
776 | 0 | 8 |
_iPrinted edition: _z9783642157820 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6347 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-15781-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c181185 _d181185 |