Using sparsification for parametric minimum spanning tree problems

Authors:
David Fernández-Baca;Giora Slutzki;David Eppstein
Affiliations:
Department of Computer Science, Iowa State University, Ames, IA;Department of Computer Science, Iowa State University, Ames, IA;Department of Information and Computer Science, University of California, Irvine CA
Venue:
Nordic Journal of Computing
Year:
1996

Citing 18
Cited 6

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
A data structure for dynamic trees

Journal of Computer and System Sciences
Maximizing classes of two-parameter objectives over matroids

Mathematics of Operations Research
Multi-constrained matroidal knapsack problems

Mathematical Programming: Series A and B
Introduction to algorithms

Introduction to algorithms
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Diameter, width, closest line pair, and parametric searching

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A deterministic algorithm for the three-dimensional diameter problem

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Extremal polygon containment problems

Computational Geometry: Theory and Applications
A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM (JACM)
Geometric lower bounds for parametric matroid optimization

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

Journal of the ACM (JACM)
Parametric Combinatorial Computing and a Problem of Program Module Distribution

Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Optimal Parametric Search on Graphs of Bounded Tree-Width

SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
The Constrained Minimum Spanning Tree Problem (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs

LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics

Sparsification—a technique for speeding up dynamic graph algorithms

Journal of the ACM (JACM)
Notes on computing peaks in k-levels and parametric spanning trees

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Decomposable multi-parameter matroid optimization problems

Theoretical Computer Science - Latin American theoretical informatics
Finding the shortest bottleneck edge in a parametric minimum spanning tree

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Possibilistic bottleneck combinatorial optimization problems with ill-known weights

International Journal of Approximate Reasoning
The stackelberg minimum spanning tree game

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two applications of sparsification to parametric computing are given. The first is a fast algorithm for enumerating all distinct minimum spanning trees in a graph whose edge weights vary linearly with a parameter. The second is an asymptotically optimal algorithm for the minimum ratio spanning tree problem, as well as other search problems, on dense graphs.