Skip to main content
Conference Proceedings

Multi-parameter minimum spanning trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1776 LNCS 217-226
DOI: 10.1007/10719839_22
2Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A framework for solving certain multidimensional parametric search problems in randomized linear time is presented, along with its application to optimization on matroids, including parametric minimum spanning trees on planar and dense graphs. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Fernández-Baca, D. (2000). Multi-parameter minimum spanning trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 217–226). https://doi.org/10.1007/10719839_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free