05019nam 22007935 450 991048360720332120230221102644.01-280-38728-997866135652043-642-13731-810.1007/978-3-642-13731-0(CKB)2670000000028912(SSID)ssj0000446284(PQKBManifestationID)11314596(PQKBTitleCode)TC0000446284(PQKBWorkID)10491956(PQKB)11421330(DE-He213)978-3-642-13731-0(MiAaPQ)EBC3065393(PPN)149064004(EXLCZ)99267000000002891220100610d2010 u| 0engurnn|008mamaatxtccrAlgorithm Theory - SWAT 2010 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings /edited by Haim Kaplan1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (448 p. 69 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6139Bibliographic Level Mode of Issuance: Monograph3-642-13730-X Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;6139Computer programmingAlgorithmsComputer science—MathematicsDiscrete mathematicsComputer graphicsArtificial intelligence—Data processingComputer scienceProgramming TechniquesAlgorithmsDiscrete Mathematics in Computer ScienceComputer GraphicsData ScienceTheory of ComputationComputer programming.Algorithms.Computer science—Mathematics.Discrete mathematics.Computer graphics.Artificial intelligence—Data processing.Computer science.Programming Techniques.Algorithms.Discrete Mathematics in Computer Science.Computer Graphics.Data Science.Theory of Computation.005.11Kaplan Haimedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910483607203321Algorithm Theory - SWAT 20102830216UNINA