LEADER 05019nam 22007935 450 001 9910483607203321 005 20230221102644.0 010 $a1-280-38728-9 010 $a9786613565204 010 $a3-642-13731-8 024 7 $a10.1007/978-3-642-13731-0 035 $a(CKB)2670000000028912 035 $a(SSID)ssj0000446284 035 $a(PQKBManifestationID)11314596 035 $a(PQKBTitleCode)TC0000446284 035 $a(PQKBWorkID)10491956 035 $a(PQKB)11421330 035 $a(DE-He213)978-3-642-13731-0 035 $a(MiAaPQ)EBC3065393 035 $a(PPN)149064004 035 $a(EXLCZ)992670000000028912 100 $a20100610d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithm Theory - SWAT 2010 $e12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings /$fedited by Haim Kaplan 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (448 p. 69 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6139 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13730-X 320 $aIncludes bibliographical references and index. 327 $aOptimal 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6139 606 $aComputer programming 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aArtificial intelligence?Data processing 606 $aComputer science 606 $aProgramming Techniques 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 606 $aData Science 606 $aTheory of Computation 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aData Science. 615 24$aTheory of Computation. 676 $a005.11 702 $aKaplan$b Haim$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910483607203321 996 $aAlgorithm Theory - SWAT 2010$92830216 997 $aUNINA