Algorithm Theory - SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings by Joachim GudmundssonAlgorithm Theory - SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings by Joachim Gudmundsson

Algorithm Theory - SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden…

byJoachim Gudmundsson

Hardcover | June 19, 2008

Pricing and Purchase Info

$178.50

Earn 893 plum® points

Prices and offers may vary in store

HURRY, ONLY 4 LEFT!
Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008, held in Gothenborg, Sweden, in July 2008. The 36 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 111 submissions. Papers were solicited for original research on algorithms and data structures in all areas, including but not limited to: approximation algorithms, computational biology, computational geometry, distributed algorithms, external-memory algorithms, graph algorithms, online algorithms, optimization algorithms, parallel algorithms, randomized algorithms, string algorithms and algorithmic game theory.
Title:Algorithm Theory - SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden…Format:HardcoverDimensions:438 pages, 23.5 × 15.5 × 0.01 inPublished:June 19, 2008Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540699007

ISBN - 13:9783540699002

Look for similar items by category:

Reviews

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.