Algorithm Theory – SWAT 2008 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings /
| Corporate Author: | |
|---|---|
| Other Authors: | |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2008.
|
| Edition: | 1st ed. 2008. |
| Series: | Theoretical Computer Science and General Issues ;
5124 |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-540-69903-3 |
Table of Contents:
- Invited Lectures
- A Survey of Results for Deletion Channels and Related Synchronization Channels
- Nash Bargaining Via Flexible Budget Markets
- Contributed Papers
- Simplified Planar Coresets for Data Streams
- Uniquely Represented Data Structures for Computational Geometry
- I/O Efficient Dynamic Data Structures for Longest Prefix Queries
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Vision-Based Pursuit-Evasion in a Grid
- Angle Optimization in Target Tracking
- Improved Bounds for Wireless Localization
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
- The Maximum Energy-Constrained Dynamic Flow Problem
- Bounded Unpopularity Matchings
- Data Structures with Local Update Operations
- On the Redundancy of Succinct Data Structures
- Confluently Persistent Tries for Efficient Version Control
- A Uniform Approach Towards Succinct Representation of Trees
- An Algorithm for L(2,1)-Labeling of Trees
- Batch Coloring Flat Graphs and Thin
- Approximating the Interval Constrained Coloring Problem
- A Path Cover Technique for LCAs in Dags
- Boundary Labeling with Octilinear Leaders
- Distributed Disaster Disclosure
- Reoptimization of Steiner Trees
- On the Locality of Extracting a 2-Manifold in
- On Metric Clustering to Minimize the Sum of Radii
- On Covering Problems of Rado
- Packing Rectangles into 2OPT Bins Using Rotations
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
- On a Special Co-cycle Basis of Graphs
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- Spanners of Additively Weighted Point Sets
- The Kinetic Facility Location Problem
- Computing the Greedy Spanner in Near-Quadratic Time
- Parameterized Computational Complexity of Dodgson and Young Elections
- Online Compression Caching
- On Trade-Offs in External-Memory Diameter-Approximation.