Multi-parameter minimum spanning trees

David Fernández-Baca
Proc. 4th Latin American Symp. Theoretical Informatics (LATIN 2000), Lecture Notes in Computer Science 1776, Gaston H. Gonnet, Daniel Panario, and Alfredo Viola, ed., Springer-Verlag, 2000, pp. 217–226

Cites:

• Geometric lower bounds for parametric matroid optimization
• Sparsification — A technique for speeding up dynamic graph algorithms
• Separator based sparsification I: planarity testing and minimum spanning trees
• Using sparsification for parametric minimum spanning tree problems