Algorithm Theory - SWAT 2004

Language: English

Published by Springer, Springer Jun 2004, 2004

3540223398 / 9783540223399

  • Softcover
  • New
See all details

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

5-star seller

AbeBooks seller since January 23, 2017

Softcover

Condition: New

£ 46.69

£ 50.86 shipping 
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - Print on Demand Titel. Neuware -Invited Contributions.- Design and Analysis of Dynamic Multithreaded Algorithms.- Cache-Oblivious Algorithms and Data Structures.- Refereed Contributions.- Getting the Best Response for Your Erg.- Auctions with Budget Constraints.- Tight Approximability Results for Test Set Problems in Bioinformatics.- Robust Subgraphs for Trees and Paths.- Collective Tree Spanners of Graphs.- Optimally Competitive List Batching.- The Relative Worst Order Ratio Applied to Seat Reservation.- Online Maintenance of k-Medians and k-Covers on a Line.- Matching Polyhedral Terrains Using Overlays of Envelopes.- Independent Set of Intersection Graphs of Convex Objects in 2D.- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion.- Construction of the Nearest Neighbor Embracing Graph of a Point Set.- Connectivity of Graphs Under Edge Flips.- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension.- Railway Delay Management: Exploring Its Algorithmic Complexity.- Layered Heaps.- Melding Priority Queues.- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.- New Algorithms for Enumerating All Maximal Cliques.- The Multi-multiway Cut Problem.- The Bottleneck Problem with Minimum Quantity Commitments.- All-Norm Approximation for Scheduling on Identical Machines.- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler.- Approximation Schemes for the Crane Scheduling Problem.- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems.- A ( )-Approximation Algorithm for the Stable Marriage Problem.-Maximizing the Number of Packed Rectangles.- Two Space Saving Tricks for Linear Time LCP Array Computation.- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles.- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks.- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.- The Optimal Online Algorithms for Minimizing Maximum Lateness.- Power Assignment in Radio Networks with Two Power Levels.- Pointed Binary Encompassing Trees.- On Geometric Structure of Global Roundings for Graphs and Range Spaces.- External Connected Components.- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.- Simplified External Memory Algorithms for Planar DAGs.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 524 pp. Englisch.…

Seller Inventory # 9783540223399

Title
Algorithm Theory - SWAT 2004
Author
Torben Hagerup
Publisher
Springer, Springer Jun 2004
Publication year
2004
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
3540223398
ISBN 13
9783540223399
Item weight
785 grams
Dimensions
235x155x29 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Germany

5-star seller

AbeBooks seller since January 23, 2017

Shipping rates from Germany to U.S.A.

Item60 to 60 business days60 to 60 business days
First item£ 50.86£ 63.57
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check
  • Paypal

Store description

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specialty

Modernes Antiquariat - Bücher von 1960 bis heute

Seller's business information

buchversandmimpf2000

Germany