| Description |
1 online resource (xi, 232 pages) : illustrations |
| Series |
Lecture notes in computer science, 1611-3349 ; 6552 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6552. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Machine generated contents note: Invited Talks -- Geometry and Topology from Point Cloud Data / Tamal Krishna Dey -- Disjoint Paths Problem: Algorithm and Structure / Ken-ichi Kawarabayashi -- Physarum Computer / Kurt Mehlhorn -- Approximation Algorithms -- Maximum Betweenness Centrality: Approximability and Tractable Cases / Joachim Spoerhase -- Approximation Algorithms for Minimum Chain Vertex Deletion / Saket Saurabh -- Oblivious Buy-at-Bulk in Planar Graphs / S. Sitharama Iyengar -- Hardness -- Complexity of Acyclic Subhypergraph Problems / Yann Strozecki -- Inapproximability of b-Matching in k-Uniform Hypergraphs / Anand Srivastav -- k-Level Crossing Minimization Is NP-Hard for Trees / Patrick Healy -- Algorithm Engineering -- Efficient Computation of Time-Dependent Centralities in Air Transportation Networks / Alexander Zock -- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices / Michael Schneider -- Computational Geometry -- Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point / Sandip Das -- Efficient Top-k Queries for Orthogonal Ranges / K.S. Rajan -- Range-Aggregate Queries Involving Geometric Aggregation Operations / Kannan Srinathan -- Approximation Algorithms -- Multi Cover of a Polygon Minimizing the Sum of Areas / Gila Morgenstern -- On the Discrete Unit Disk Cover Problem / Bradford G. Nickerson -- Clustering with Internal Connectedness / Yogish Sabharwal -- String Algorithms -- Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems / Christian Scheideler -- De Bruijn Sequences for the Binary Strings with Maximum Density / Aaron Williams -- Graph Algorithms -- Polynomial Time Algorithm for Longest Paths in Biconvex Graphs / C. Pandu Rangan -- Counting Spanning Trees in Graphs Using Modular Decomposition / Charis Papadopoulos |
|
Note continued: On Graceful Labelings of Trees (Extended Abstract) / Md. Saidur Rahman -- Minimum-Layer Drawings of Trees (Extended Abstract) / Md. Saidur Rahman |
| Summary |
Annotation This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011. The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions. The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Computer algorithms -- Congresses
|
|
Informatique.
|
|
Computer algorithms
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Katoh, Naoki.
|
|
Kumar, Amit.
|
| ISBN |
9783642190940 |
|
3642190944 |
|
