Willkommen, schön sind Sie da!
Logo Ex Libris

Algorithm Theory - SWAT 2008

  • E-Book (pdf)
  • 438 Seiten
(0) Erste Bewertung abgeben
Alle Bewertungen ansehen
Inhalt Invited Lectures.- A Survey of Results for Deletion Channels and Related Synchronization Channels.- Nash Bargaining Via Fle... Weiterlesen
E-Books ganz einfach mit der kostenlosen Ex Libris-Reader-App lesen. Hiererhalten Sie Ihren Download-Link.
CHF 120.90
Download steht sofort bereit
Informationen zu E-Books
E-Books eignen sich auch für mobile Geräte (sehen Sie dazu die Anleitungen).
E-Books von Ex Libris sind mit Adobe DRM kopiergeschützt: Erfahren Sie mehr.
Weitere Informationen finden Sie hier.
Bestellung & Lieferung in eine Filiale möglich



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.


Titel: Algorithm Theory - SWAT 2008
Untertitel: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings
EAN: 9783540699033
Format: E-Book (pdf)
Hersteller: Springer Berlin Heidelberg
Genre: IT & Internet
Veröffentlichung: 02.07.2008
Digitaler Kopierschutz: Wasserzeichen
Dateigrösse: 7.99 MB
Anzahl Seiten: 438

Weitere Bände aus der Buchreihe "Theoretical Computer Science and General Issues"