New Added

Algorithm theory – SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, proceedings

Like Score+470

Algorithm theory – SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, proceedings
Original Title Algorithm theory – SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, proceedings
Author Scandinavian Workshop on Algorithm Theory (9th 2004 Humlebaek, Denmark), Hagerup, Torben, Katajainen, Jyrki
Publication date

Topics Algorithms, Computational complexity
Publisher Berlin , New York : Springer
Collection folkscanomy_miscellaneous, folkscanomy, additional_collections
Language English
Book Type EBook
Material Type Book
File Type PDF
Downloadable Yes
Support Mobile, Desktop, Tablet
Scan Quality: Best No watermark
PDF Quality: Good
Availability Yes
Price 0.00
Submitted By
Sketch the Cow
Submit Date
Algorithm Theory – SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004. ProceedingsAuthor: Torben Hagerup, Jyrki Katajainen Published by Springer Berlin Heidelberg ISBN: 978-3-540-22339-9 DOI: 10.1007/b98413Table of Contents:Design and Analysis of Dynamic Multithreaded Algorithms
Cache-Oblivious Algorithms and Data Structures
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 QueuesIncludes bibliographical references and index
We will be happy to hear your thoughts

Leave a reply

eBookmela
Logo
Register New Account
Reset Password
Compare items
  • Total (0)
Compare
0