Custom cover image
Custom cover image

Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / edited by Haim Kaplan

By: Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 6139Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: Online-Ressource (448p. 69 illus, digital)ISBN:
  • 9783642137310
  • 1280387289
Subject(s): Genre/Form: Additional physical formats: 9783642137303 | Buchausg. u.d.T.: Algorithm theory - SWAT 2010. Berlin : Springer, 2010. XIII, 448 S.DDC classification:
  • 005.1
  • 005.11 23
  • 004
  • 004 510
MSC: MSC: *68-06 | 68Wxx | 00B25LOC classification:
  • QA76.9.A43
  • QA9.58
DOI: DOI: 10.1007/978-3-642-13731-0Online resources: Summary: Optimal Exploration of Terrains with Obstacles -- Reconstructing a Simple Polygon from Its Angles -- Semidefinite Programming and Approximation Algorithms: A Survey -- Strictly-Regular Number System and Data Structures -- An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times -- The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition -- A Bottom-Up Method and Fast Algorithms for max independent set -- Capacitated Domination Faster Than O(2 n ) -- Isomorphism for Graphs of Bounded Feedback Vertex Set Number -- On Feedback Vertex Set New Measure and New Structures -- Conflict-Free Coloring Made Stronger -- Polychromatic Coloring for Half-Planes -- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem -- Minimum and Maximum against k Lies -- Feasible and Accurate Algorithms for Covering Semidefinite Programs -- The Quantitative Analysis of User Behavior Online – Data, Models and Algorithms -- Systems of Linear Equations over and Problems Parameterized above Average -- Capacitated max -Batching with Interval Graph Compatibilities -- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs -- Representing a Functional Curve by Curves with Fewer Peaks -- Bregman Clustering for Separable Instances -- Improved Methods For Generating Quasi-gray Codes -- The MST of Symmetric Disk Graphs Is Light -- Vector Bin Packing with Multiple-Choice -- Bin Packing with Fixed Number of Bins Revisited -- Cops and Robber Game without Recharging -- Path Schematization for Route Sketches -- Approximation Algorithms for Free-Label Maximization -- Phase Transitions in Sampling Algorithms and the Underlying Random Structures -- Polynomial Kernels for Hard Problems on Disk Graphs -- Faster Parameterized Algorithms for Minor Containment -- Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing -- Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput -- Online Function Tracking with Generalized Penalties -- Better Bounds on Online Unit Clustering -- Online Selection of Intervals and t-Intervals -- Approximating the Maximum 3- and 4-Edge-Colorable Subgraph -- Improved Algorithm for Degree Bounded Survivable Network Design Problem -- Minimizing the Diameter of a Network Using Shortcut Edges.PPN: PPN: 1649786972Package identifier: Produktsigel: ZDB-2-SCS | ZDB-2-LNC | ZDB-2-SEB | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT