did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9783540223399

Algorithm Theory - Swat 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings

by ; ;
  • ISBN13:

    9783540223399

  • ISBN10:

    3540223398

  • Format: Paperback
  • Copyright: 2004-08-15
  • Publisher: Springer Verlag
  • Purchase Benefits
List Price: $139.00

Summary

This book constitutes the refereed proceedings of the 9th Scandinavian Workshop on Algorithm Theory, SWAT 2004, held in Humlebaek, Denmark in July 2004. The 40 revised full papers presented together with an invited paper and the abstract of an invited talk were carefully reviewed and selected from 121 submissions. The papers span the entire range of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, bioinformatics, combinatorics, sorting, searching, online algorithms, optimization, etc.

Table of Contents

Design and analysis of dynamic multithreaded algorithmsp. 1
Cache-oblivious algorithms and data structuresp. 3
Getting the best response for your Ergp. 14
Auctions with budget constraintsp. 26
Tight approximability results for test set problems in bioinformaticsp. 39
Robust subgraphs for trees and pathsp. 51
Collective tree spanners of graphsp. 64
Optimally competitive list batchingp. 77
The relative worst order ratio applied to seat reservationp. 90
Online maintenance of k-meridians and k-covers on a linep. 102
Matching polyhedral terrains using overlays of envelopesp. 114
Independent set of intersection graphs of convex objects in 2Dp. 127
Maximizing the area of overlap of two unions of disks under rigid motionp. 138
Construction of the nearest neighbor embracing graph of a point setp. 150
Connectivity of graphs under edge flipsp. 161
Improvement of Nemhauser-Trotter theorem and its applications in parametrized complexityp. 174
A simple linear-time modular decomposition algorithm for graphs, using order extensionp. 187
Railway delay management : exploring its algorithmic complexityp. 199
Layered heapsp. 212
Melding priority queuesp. 223
An algorithm for cyclic edge connectivity of cubic graphsp. 236
Subexponential-time framework for optimal embeddings of graphs in integer latticesp. 248
New algorithms for enumerating all maximal cliquesp. 260
The multi-multiway cut problemp. 273
The bottleneck problem with minimum quantity commitmentsp. 285
All-norm approximation for scheduling on identical machinesp. 298
Approximation algorithms for the general max-min resource sharing problem : faster and simplerp. 311
Approximation schemes for the crane scheduling problemp. 323
Improved approximation algorithms for the single-sink buy-at-bulk network design problemsp. 336
A (2 - c[actual symbol not reproducible])-approximation for the stable marriage problemp. 349
Maximizing the number of packed rectanglesp. 362
Two space saving tricks for linear time LCP array computationp. 372
Fully-dynamic all-pairs shortest paths : faster and allowing negative cyclesp. 384
Faster deterministic gossiping in directed ad hoc radio networksp. 397
Online scheduling of splittable tasks in peer-to-peer networksp. 408
The optimal online algorithms for minimizing maximum latenessp. 420
Power assignment in radio networks with two power levelsp. 431
Pointed binary encompassing treesp. 442
On geometric structure of global roundings for graphs and range spacesp. 455
External connected componentsp. 468
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest pathsp. 480
Simplified external memory algorithms for planar DAGsp. 493
Table of Contents provided by Blackwell. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program