Screen LibraryAlgorithms - ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013 : proceedings /
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 in...
Saved in:
| Corporate Authors: | ; |
|---|---|
| Group Author: | ; |
| Published: |
Springer,
|
| Publisher Address: | Heidelberg : |
| Publication Dates: | [2013] |
| Literature type: | eBook |
| Language: | English |
| Series: |
Lecture notes in computer science,
8125 |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1007/978-3-642-40450-4 |
| Summary: |
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms. |
| Carrier Form: | 1 online resource (xviii, 829 pages) : illustrations. |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: |
9783642404504 (electronic bk.) 3642404502 (electronic bk.) |
| Index Number: | QA76 |
| CLC: |
O24-532 TP301.6-532 |
| Contents: |
The Online Replacement Path Problem / Flip Distance between Triangulations of a Simple Polygon is NP-Complete / Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures / Computing the Greedy Spanner in Linear Space / Friendship and Stable Matching / An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters / Logit Dynamics with Concurrent Updates for Local Interaction Games / On Resilient Graph Spanners / Maximizing Barrier Coverage Lifetime with Mobile Sensors / Theory and Implementation of Online Multiselection Algorithms / An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering / Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform / Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement / A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree / Parallel String Sample Sort / Exclusive Graph Searching / Largest Chordal and Interval Subgraphs Faster Than 2 n / Revisiting the Problem of Searching on a Line / On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity / The Encoding Complexity of Two Dimensional Range Minimum Data Structures / Computing the Fréchet Distance with a Retractable Leash / Vertex Deletion for 3D Delaunay Triangulations / Economic 3-Colored Subdivision of Triangulations / Limitations of Deterministic Auction Design for Correlated Bidders / Connectivity Inference in Mass Spectrometry Based Structure Determination / Secluded Connectivity Problems / List H-Coloring a Graph by Removing Few Vertices / Rumor Spreading in Random Evolving Graphs / Dynamic Graphs in the Sliding-Window Model / A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems / Tight Kernel Bounds for Problems on Graphs with Small Degeneracy / Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap / Inefficiency of Standard Multi-unit Auctions / FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations / Maximizing a Submodular Function with Viability Constraints / Table Cartograms / Network Bargaining with General Capacities / Nearly Optimal Private Convolution / Tractable Parameterizations for the Minimum Linear Arrangement Problem / Compressed Cache-Oblivious String B-tree / BICO: BIRCH Meets Coresets for k-Means Clustering / Long Circuits and Large Euler Subgraphs / Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph / Binary Jumbled Pattern Matching on Trees and Tree-Like Structures / Kernelization Using Structural Parameters on Sparse Graph Classes / On the Computational Complexity of Erdős-Szekeres and Related Problems in R3 / Encodings for Range Selection and Top-k Queries / Fréchet Queries in Geometric Trees / A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs / An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions / Balls into Bins Made Faster / An Alternative Approach to Alternative Routes: HiDAR / Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet / Better Approximation Algorithms for Technology Diffusion / On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility / Balanced Neighbor Selection for BitTorrent-Like Networks / Parameterized Complexity of Directed Steiner Tree on Sparse Graphs / Improved Approximation Algorithms for Projection Games / The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology / Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections / The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial / Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets / Optimal Color Range Reporting in One Dimension / Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling / Euclidean Greedy Drawings of Trees / Sparse Fault-Tolerant BFS Trees / On the Most Likely Convex Hull of Uncertain Points / Top-k Document Retrieval in External Memory / Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core Architectures / |