LEADER 05589nam 22008175 450 001 9910483655603321 005 20230406070530.0 010 $a1-280-39062-X 010 $a9786613568540 010 $a3-642-17517-1 024 7 $a10.1007/978-3-642-17517-6 035 $a(CKB)2670000000064713 035 $a(SSID)ssj0000475850 035 $a(PQKBManifestationID)11291924 035 $a(PQKBTitleCode)TC0000475850 035 $a(PQKBWorkID)10485960 035 $a(PQKB)11523545 035 $a(DE-He213)978-3-642-17517-6 035 $a(MiAaPQ)EBC3066226 035 $a(PPN)149893590 035 $a(EXLCZ)992670000000064713 100 $a20101203d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Computation $e21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I /$fedited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XVIII, 465 p. 66 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6506 300 $aInternational conference proceedings. 311 $a3-642-17516-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Regular Labelings and Geometric Structures -- Algorithmic Aspects of Secure Computation and Communication -- Session 1A. Approximation Algorithm I -- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament -- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 -- Approximate Periodicity -- Approximating the Average Stretch Factor of Geometric Graphs -- Session 1B. Complexity I -- Satisfiability with Index Dependency -- Anonymous Fuzzy Identity-Based Encryption for Similarity Search -- Improved Randomized Algorithms for 3-SAT -- Quantum Counterfeit Coin Problems -- Session 2A. Data Structure and Algorithm I -- Priority Range Trees -- Should Static Search Trees Ever Be Unbalanced? -- Levelwise Mesh Sparsification for Shortest Path Queries -- Unit-Time Predecessor Queries on Massive Data Sets -- Session 2B. Combinatorial Optimization -- Popularity at Minimum Cost -- Structural and Complexity Aspects of Line Systems of Graphs -- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra -- Generating Trees on Multisets -- Session 3A. Graph Algorithm I -- Seidel Minor, Permutation Graphs and Combinatorial Properties -- Simultaneous Interval Graphs -- Unbalanced Graph Partitioning -- On the Intersection of Tolerance and Cocomparability Graphs -- Flows in One-Crossing-Minor-Free Graphs -- Session 3B. Complexity II -- From Holant to #CSP and Back: Dichotomy for Holant c Problems -- Computing Sparse Multiples of Polynomials -- Fractal Parallelism: Solving SAT in Bounded Space and Time -- Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity -- New Upper Bounds on the Average PTF Density of Boolean Functions -- Session 4A. Computational Geometry I -- An Optimal Algorithm for Computing Angle-Constrained Spanners -- Approximating Minimum Bending Energy Path in a Simple Corridor -- Session 4B. Graph Coloring I -- Analysis of an Iterated Local Search Algorithm for Vertex Coloring -- Bounded Max-colorings of Graphs -- Session 5A. Fixed Parameter Tractability -- Parameterized Algorithms for Boxicity -- On Tractable Cases of Target Set Selection -- Combining Two Worlds: Parameterised Approximation for Vertex Cover -- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time -- Session 5B. Optimization -- Lower Bounds for Howard?s Algorithm for Finding Minimum Mean-Cost Cycles -- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut -- An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems -- A Faster Algorithm for the Maximum Even Factor Problem. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6506 606 $aComputer programming 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aComputer graphics 606 $aArtificial intelligence?Data processing 606 $aProgramming Techniques 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aComputer Graphics 606 $aData Science 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aComputer graphics. 615 0$aArtificial intelligence?Data processing. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 615 24$aData Science. 676 $a005.11 702 $aCheong$b Otfried$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aChwa$b Kyung-Yong$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPark$b Kunsoo$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910483655603321 996 $aAlgorithms and Computation$9771857 997 $aUNINA