Proc. 18th annual ACM-SIAM symposium on discrete algorithms (SIAM 2007) 9780898716245, 0898716241

Discrete mathematics and graph theory, including combinatorics, combinatorial optimization and networks. Preface Acknowl

267 78 22MB

English Pages 1334 Year 2007

Report DMCA / Copyright

DOWNLOAD DJVU FILE

Table of contents :
PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS......Page 1
CONTENTS......Page 4
PREFACE......Page 14
ACKNOWLEDGMENTS......Page 15
Region-Fault Tolerant Geometric Spanners......Page 18
Compacting cuts:a new linear formulation for minimum cut......Page 60
Multiple Source Shortest Paths in a Genus g Graph......Page 106
Analytic Combinatorics A Calculus of Discrete Structures......Page 154
Equilibria in Online Games......Page 166
Better Online Buffer Management......Page 216
Minimizing Movement......Page 275
Model-driven Optimization using Adaptive Probes......Page 325
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling......Page 373
Deterministic pivoting algorithms for constrained ranking and clustering problems......Page 422
An Elementary Construction of Constant-Degree Expanders......Page 471
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion......Page 519
Resilient Search Trees......Page 564
Testing for a theta......Page 612
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences......Page 616
Approximating the Spanning Star Forest Problem and Its Applications to Genomic Sequence Alignment......Page 662
A Network Formation Game for Bipartite Exchange Economies......Page 714
On Bregman Voronoi Diagrams......Page 763
Energy Efficient Online Deadline Scheduling......Page 812
Maximum s-t-flow with k crossings in O(k3nlog n) time......Page 860
Noisy binary search and its applications......Page 898
Semi-oblivious Routing: Lower Bounds......Page 946
All-Pairs Bottleneck Paths in Vertex Weighted Graphs......Page 995
Combinatorial Algorithms for Web Search Engines - Three Success Stories......Page 1039
k-means++: The Advantages of Careful Seeding......Page 1044
Reconstruction Using Witness Complexes......Page 1093
Games of fixed rank: A hierarchy of bimatrix games......Page 1141
The Independent Even Factor Problem......Page 1188
Quantum Algorithms for Simon's Problem Over General Groups......Page 1234
Approximation Algorithms for Node-Weighted Buy-at-Bulk Network Design......Page 1282
AUTHOR INDEX......Page 1332

Proc. 18th annual ACM-SIAM symposium on discrete algorithms (SIAM 2007)
 9780898716245, 0898716241

  • 0 0 0
  • Like this paper and download? You can publish your own PDF file online for free in a few minutes! Sign Up
Recommend Papers