Table of contents : PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS......Page 1 CONTENTS......Page 4 PREFACE......Page 13 ACKNOWLEDGMENTS......Page 14 In Memoriam......Page 17 Session 1A Optimal Parallel Selection......Page 18 Session 1B Algorithms for Power Savings......Page 54 Session 1C Sublogarithmic Approximation for Telephone Multicast:Path out of Jungle......Page 93 Session 2 INVITED PLENARY ABSTRACT......Page 116 Session 3A Binary Space Partitions for 3D Subdivisions......Page 117 Session 3B Improved Bounds on the Average Length of Longest Common Subsequences*......Page 147 Session 3C Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs......Page 175 Session 4A Optimizing misdirection......Page 209 Session 4B Pass Efficient Algorithms for Approximating Large Matrices......Page 240 Session 4C Certifying and Repairing Solutions to Large LPs......Page 272 Session 5A The Flow Complex: A Data Structure for Geometric Modeling"......Page 302 Session 5B Random Walks on the Vertices of Transportation Polytopes with Constant Number of Sources......Page 347 Session 5C Space-Efficient Finger Search on Degree-Balanced Search Trees"......Page 391 Session 6 INVITED PLENARY ABSTRACT......Page 430 Session 7A Sparse Distance Preservers and Additive Spanners......Page 431 Session 7B Improved Results for Dkected Multicut......Page 471 Session 7C A note on the set systems used for broadcast encryption......Page 487 Session 8A Simultaneous Optimization for Concave Costs: Single SinkAggregation or Single Source Buy-at-Bulk......Page 516 Session 8B Lower Bounds for Embedding Edit Distance into Normed Spaces......Page 540 Session 8C Better Algorithms for High-dimensional Proximity Problems via Asymmetric Embeddings......Page 556 Session 9A On the Rectilinear Crossing Number of Complete Graphs......Page 600 Session 9B Edge Disjoint Paths Revisited......Page 645 Session 9C Implicit Dictionaries Supporting Searches and Amortized Updates in O(log n log log n) Time......Page 687 Session 10 INVITED PLENARY ABSTRACT......Page 725 Session 11A Between O(nm) and O(na) *......Page 726 Session 11B Efficient Sequences of Trials......Page 754 Session 11C Competitive Queueing Policies for QoS Switches......Page 778 Session 12A Smaller Core-Sets for Balls......Page 818 Session 12B Inferring Tree Topologies Using Flow Tests......Page 845 Session 12C High-Order Entropy-Compressed Text Indexes......Page 858 AUTHOR INDEX......Page 890