Blick ins Buch

Algorithm Theory – SWAT 2008

11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings

Joachim Gudmundsson (Herausgeber)

Buch | Softcover

XIII, 438 Seiten

2008 | 2008
Springer Berlin (Verlag)
978-3-540-69900-2 (ISBN)

Lese- und Medienproben

Blick ins Buch (midvox)

Artikel merken

The Scandinavian Workshop on Algorithm Theory (SWAT) is a biennial int- national conferenceintended as a forum for researchersin the area of design and analysisofalgorithmsanddatastructures. The?rstSWATworkshopwasheldin Halmstad, Sweden, in 1988. Since then it has been held biennially, rotating - tween the ?ve Nordic countries Denmark, Finland, Iceland, Norway and S- den, with the exception of 2006 when it was in Riga. Earlier SWATs were held in Humlebæk, Denmark (2004), Turku, Finland (2002), Bergen, Norway (2000), ? Stockholm, Sweden (1998), Reykjavik, Iceland (1996), Arhus, Denmark (1994), Helsinki,Finland(1992),Bergen,Norway(1990)andHalmstad,Sweden(1988). This volume contains the contributed papers presented at the 11th Sc- dinavian Workshop on Algorithm Theory (SWAT 2008), held in Gothenburg, Sweden, July 2 4, 2008. In addition, the volume also includes abstracts of an invited talk by Michael Mitzenmacher on A Survey of Results for Deletion Channels and Related Synchronization Channels and by Vijay V. Vazirani on Nash Bargaining via Flexible Budget Markets. Papers were solicited for original research on algorithms and data structures in all areas, including but not limited to: approximation algorithms, compu- tionalbiology,computationalgeometry,distributedalgorithms,external-memory algorithms,graphalgorithms,online algorithms,optimization algorithms,par- lel algorithms, randomized algorithms, string algorithms and algorithmic game theory. The 36 contributed papers were chosen from 111 submissions. Revised and expanded versions of selected papers will be considered for publication in a special issue of Algorithmica. The best paper award was given to Yossi Azar, Uriel Feige and Daniel Glasner for their paper A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. Eachpaperwasreviewedbyatleastthreereferees,andevaluatedonthequ- ity,originalityandrelevanceto the symposium.

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.

Erscheint lt. Verlag	19.6.2008
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XIII, 438 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Mathematik / Informatik ► Informatik ► Datenbanken
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Schlagworte	Algorithm analysis and problem complexity • algorithmic game theory • Algorithmics • algorithms • Approximation • art gallery • Clustering • Combinatorial Algorithms • Complexity • Computational Discrete Mathematics • Computational Geometry • Computational Graph Theory • data structures • distributed algorithms • Dynamic Flows • Facility Location • geometric computations • Graph Algorithms • Graph Computations • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • kinetic data structure • maximum flows • network algorithms • Optimization • packing • parameterized algorithmics • pseudo-triangulation • Scheduling • Searching • sensor networks • vertex coloring
ISBN-10	3-540-69900-7 / 3540699007
ISBN-13	978-3-540-69900-2 / 9783540699002
Zustand	Neuware