05614nam 22008175 450 99646601010331620230406070530.01-280-39062-X97866135685403-642-17517-110.1007/978-3-642-17517-6(CKB)2670000000064713(SSID)ssj0000475850(PQKBManifestationID)11291924(PQKBTitleCode)TC0000475850(PQKBWorkID)10485960(PQKB)11523545(DE-He213)978-3-642-17517-6(MiAaPQ)EBC3066226(PPN)149893590(EXLCZ)99267000000006471320101203d2010 u| 0engurnn|008mamaatxtccrAlgorithms and Computation[electronic resource] 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I /edited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XVIII, 465 p. 66 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6506International conference proceedings.3-642-17516-3 Includes bibliographical references and index.Invited 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.Theoretical Computer Science and General Issues,2512-2029 ;6506Computer programmingAlgorithmsComputer science—MathematicsDiscrete mathematicsComputer networksComputer graphicsArtificial intelligence—Data processingProgramming TechniquesAlgorithmsDiscrete Mathematics in Computer ScienceComputer Communication NetworksComputer GraphicsData ScienceComputer programming.Algorithms.Computer science—Mathematics.Discrete mathematics.Computer networks.Computer graphics.Artificial intelligence—Data processing.Programming Techniques.Algorithms.Discrete Mathematics in Computer Science.Computer Communication Networks.Computer Graphics.Data Science.005.11Cheong Otfriededthttp://id.loc.gov/vocabulary/relators/edtChwa Kyung-Yongedthttp://id.loc.gov/vocabulary/relators/edtPark Kunsooedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466010103316Algorithms and Computation771857UNISA