000 | 07225nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-31951-1 | ||
003 | DE-He213 | ||
005 | 20240730184826.0 | ||
007 | cr nn 008mamaa | ||
008 | 100315s2005 gw | s |||| 0|eng d | ||
020 |
_a9783540319511 _9978-3-540-31951-1 |
||
024 | 7 |
_a10.1007/11561071 _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 2005 _h[electronic resource] : _b13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings / _cedited by Gerth S. Brodal, Stefano Leonardi. |
250 | _a1st ed. 2005. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
300 |
_aXVIII, 901 p. _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 ; _v3669 |
|
505 | 0 | _aDesigning Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut -- Relax-and-Cut for Capacitated Network Design -- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, -- The Complexity of Games on Highly Regular Graphs -- Computing Equilibrium Prices: Does Theory Meet Practice? -- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions -- An Algorithm for the SAT Problem for Formulae of Linear Length -- Linear-Time Enumeration of Isolated Cliques -- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs -- Delineating Boundaries for Imprecise Regions -- Exacus: Efficient and Exact Algorithms for Curves and Surfaces -- Min Sum Clustering with Penalties -- Improved Approximation Algorithms for Metric Max TSP -- Unbalanced Graph Cuts -- Low Degree Connectivity in Ad-Hoc Networks -- 5-Regular Graphs are 3-Colorable with Positive Probability -- Optimal Integer Alphabetic Trees in Linear Time -- Predecessor Queries in Constant Time? -- An Algorithm for Node-Capacitated Ring Routing -- On Degree Constrained Shortest Paths -- A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time -- Roll Cutting in the Curtain Industry -- Space Efficient Algorithms for the Burrows-Wheeler Backtransformation -- Cache-Oblivious Comparison-Based Algorithms on Multisets -- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation -- Allocating Memory in a Lock-Free Manner -- Generating Realistic Terrains with Higher-Order Delaunay Triangulations -- I/O-Efficient Construction of Constrained Delaunay Triangulations -- Convex Hull and Voronoi Diagram of Additively Weighted Points -- New Tools and Simpler Algorithms for Branchwidth -- Treewidth Lower Bounds with Brambles -- Minimal Interval Completions -- A 2-Approximation Algorithm for Sorting by Prefix Reversals -- Approximating the 2-Interval Pattern Problem -- A Loopless Gray Code for Minimal Signed-Binary Representations -- Efficient Approximation Schemes for Geometric Problems? -- Geometric Clustering to Minimize the Sum of Cluster Sizes -- Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs -- Packet Routing and Information Gathering in Lines, Rings and Trees -- Jitter Regulation for Multiple Streams -- Efficient c-Oriented Range Searching with DOP-Trees -- Matching Point Sets with Respect to the Earth Mover's Distance -- Small Stretch Spanners on Dynamic Graphs -- An Experimental Study of Algorithms for Fully Dynamic Transitive Closure -- Experimental Study of Geometric t-Spanners -- Highway Hierarchies Hasten Exact Shortest Path Queries -- Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays -- Fairness-Free Periodic Scheduling with Vacations -- Online Bin Packing with Cardinality Constraints -- Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines -- Engineering Planar Separator Algorithms -- Stxxl: Standard Template Library for XXL Data Sets -- Negative Cycle Detection Problem -- An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees -- Online View Maintenance Under a Response-Time Constraint -- Online Primal-Dual Algorithms for Coveringand Packing Problems -- Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information -- Using Fractional Primal-Dual to Schedule Split Intervals with Demands -- An Approximation Algorithm for the Minimum Latency Set Cover Problem -- Workload-Optimal Histograms on Streams -- Finding Frequent Patterns in a String in Sublinear Time -- Online Occlusion Culling -- Shortest Paths in Matrix Multiplication Time -- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs -- Greedy Routing in Tree-Decomposed Graphs -- Making Chord Robust to Byzantine Attacks -- Bucket Game with Applications to Set Multicover and Dynamic Page Migration -- Bootstrapping a Hop-Optimal Network in the Weak Sensor Model -- Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs -- A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem -- Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack -- Robust Approximate Zeros -- Optimizing a 2D Function Satisfying Unimodality Properties. | |
650 | 0 |
_aComputer programming. _94169 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 1 | 4 |
_aProgramming Techniques. _9136884 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aComputer Communication Networks. _9136885 |
650 | 2 | 4 |
_aData Science. _934092 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
700 | 1 |
_aBrodal, Gerth S. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9136886 |
|
700 | 1 |
_aLeonardi, Stefano. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9136887 |
|
710 | 2 |
_aSpringerLink (Online service) _9136888 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540291183 |
776 | 0 | 8 |
_iPrinted edition: _z9783540816201 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3669 _9136889 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11561071 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c92508 _d92508 |