000 06744nam a22006255i 4500
001 978-3-540-38876-0
003 DE-He213
005 20240423125807.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540388760
_9978-3-540-38876-0
024 7 _a10.1007/11841036
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aAlgorithms - ESA 2006
_h[electronic resource] :
_b14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings /
_cedited by Yossi Azar, Thomas Erlebach.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXVIII, 850 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 ;
_v4168
505 0 _aInvited Lectures -- Origami, Linkages, and Polyhedra: Folding with Algorithms -- Reliable and Efficient Geometric Computing -- Some Computational Challenges in Today’s Bio-medicine -- Contributed Papers: Design and Analysis Track -- Kinetic Collision Detection for Convex Fat Objects -- Dynamic Connectivity for Axis-Parallel Rectangles -- Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem -- Cooperative TSP -- Fréchet Distance for Curves, Revisited -- Resource Allocation in Bounded Degree Trees -- Dynamic Algorithms for Graph Spanners -- Latency Constrained Aggregation in Sensor Networks -- Competitive Analysis of Flash-Memory Algorithms -- Contention Resolution with Heterogeneous Job Sizes -- Deciding Relaxed Two-Colorability—A Hardness Jump -- Negative Examples for Sequential Importance Sampling of Binary Contingency Tables -- Estimating Entropy over Data Streams -- Necklaces, Convolutions, and X + Y -- Purely Functional Worst Case Constant Time Catenable Sorted Lists -- Taxes for Linear Atomic Congestion Games -- Spanners with Slack -- Compressed Indexes for Approximate String Matching -- Traversing the Machining Graph -- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games -- Distributed Almost Exact Approximations for Minor-Closed Families -- Spectral Clustering by Recursive Partitioning -- Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data -- Dynamic Programming and Fast Matrix Multiplication -- Near-Entropy Hotlink Assignments -- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods -- Finding Total Unimodularity in Optimization Problems Solved by Linear Programs -- Preemptive Online Scheduling: Optimal Algorithms for All Speeds -- On the Complexity of theMultiplication Method for Monotone CNF/DNF Dualization -- Lower and Upper Bounds on FIFO Buffer Management in QoS Switches -- Graph Coloring with Rejection -- A Doubling Dimension Threshold ?(loglogn) for Augmented Graph Navigability -- Violator Spaces: Structure and Algorithms -- Region-Restricted Clustering for Geographic Data Mining -- An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths -- Cheating by Men in the Gale-Shapley Stable Matching Algorithm -- Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold -- Enumerating Spanning and Connected Subsets in Graphs and Matroids -- Less Hashing, Same Performance: Building a Better Bloom Filter -- A Unified Approach to Approximating Partial Covering Problems -- Navigating Low-Dimensional and Hierarchical Population Networks -- Popular Matchings in the Capacitated House Allocation Problem -- Inner-Product Based Wavelet Synopses for Range-Sum Queries -- Approximation in Preemptive Stochastic Online Scheduling -- Greedy in Approximation Algorithms -- I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths -- Stochastic Shortest Paths Via Quasi-convex Maximization -- Path Hitting in Acyclic Graphs -- Minimum Transversals in Posi-modular Systems -- An LP-Designed Algorithm for Constraint Satisfaction -- Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing -- Balancing Applied to Maximum Network Flow Problems -- Contributed Papers: Engineering and Applications Track -- Out-of-Order Event Processing in Kinetic Data Structures -- Kinetic Algorithms Via Self-adjusting Computation -- Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions -- Reporting Flock Patterns -- On Exact Algorithms for Treewidth -- An ImprovedConstruction for Counting Bloom Filters -- An MINLP Solution Method for a Water Network Problem -- Skewed Binary Search Trees -- Algorithmic Aspects of Proportional Symbol Maps -- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? -- Multiline Addressing by Network Flow -- The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression -- The Price of Resiliency: A Case Study on Sorting with Memory Faults -- How Branch Mispredictions Affect Quicksort -- Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces -- Engineering Highway Hierarchies -- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited -- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method.
650 0 _aSoftware engineering.
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer networks .
650 1 4 _aSoftware Engineering.
650 2 4 _aAlgorithms.
650 2 4 _aNumerical Analysis.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Science.
650 2 4 _aComputer Communication Networks.
700 1 _aAzar, Yossi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aErlebach, Thomas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540388753
776 0 8 _iPrinted edition:
_z9783540828631
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4168
856 4 0 _uhttps://doi.org/10.1007/11841036
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181775
_d181775