000 | 05268nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-642-15775-2 | ||
003 | DE-He213 | ||
005 | 20160624102149.0 | ||
007 | cr nn 008mamaa | ||
008 | 100901s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642157752 _9978-3-642-15775-2 |
||
024 | 7 |
_a10.1007/978-3-642-15775-2 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aAlgorithms – ESA 2010 _h[electronic resource] : _b18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I / _cedited by Mark Berg, Ulrich Meyer. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
300 |
_aXVIII, 587p. 68 illus. _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, _x0302-9743 ; _v6346 |
|
505 | 0 | _aInvited Talk -- The Robustness of Level Sets -- Session 1a -- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods -- Non-clairvoyant Speed Scaling for Weighted Flow Time -- A Robust PTAS for Machine Covering and Packing -- Session 1b -- Balancing Degree, Diameter and Weight in Euclidean Spanners -- Testing Euclidean Spanners -- Fast Approximation in Subspaces by Doubling Metric Decomposition -- f-Sensitivity Distance Oracles and Routing Schemes -- Session 2a -- Fast Minor Testing in Planar Graphs -- On the Number of Spanning Trees a Planar Graph Can Have -- Contractions of Planar Graphs in Polynomial Time -- Session 2b -- Communication Complexity of Quasirandom Rumor Spreading -- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing -- Contribution Games in Social Networks -- Session 3a -- Improved Bounds for Online Stochastic Matching -- Online Stochastic Packing Applied to Display Ad Allocation -- Caching Is Hard – Even in the Fault Model -- Session 3b -- Superselectors: Efficient Constructions and Applications -- Estimating the Average of a Lipschitz-Continuous Function from One Sample -- Streaming Graph Computations with a Helpful Advisor -- Session 4a -- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier -- Minimum Vertex Cover in Rectangle Graphs -- Feedback Vertex Sets in Tournaments -- Session 4b -- n-Level Graph Partitioning -- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns -- Finding the Diameter in Real-World Graphs -- Session 5a -- Budgeted Red-Blue Median and Its Generalizations -- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables -- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems -- Robust Algorithms for Sorting Railway Cars -- Session 5b -- Cloning Voronoi Diagrams via Retroactive Data Structures -- A Unified Approach to Approximate Proximity Searching -- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data -- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space -- Invited Talk -- Local Graph Exploration and Fast Property Testing -- Session 6a -- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings -- Fast Prefix Search in Little Space, with Applications -- On the Huffman and Alphabetic Tree Problem with General Cost Functions -- Medium-Space Algorithms for Inverse BWT -- Session 6b -- Median Trajectories -- Optimal Cover of Points by Disks in a Simple Polygon -- Stability of ?-Kernels -- The Geodesic Diameter of Polygonal Domains -- Session 7a -- Polyhedral and Algorithmic Properties of Quantified Linear Programs -- Approximating Parameterized Convex Optimization Problems -- Approximation Schemes for Multi-Budgeted Independence Systems -- Session 7b -- Algorithmic Meta-theorems for Restrictions of Treewidth -- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus -- Constructing the R* Consensus Tree of Two Trees in Subcubic Time. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aElectronic data processing. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aNumeric Computing. |
650 | 2 | 4 | _aData Structures. |
700 | 1 |
_aBerg, Mark. _eeditor. |
|
700 | 1 |
_aMeyer, Ulrich. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642157745 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6346 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-15775-2 |
942 |
_2EBK9299 _cEBK |
||
999 |
_c38593 _d38593 |