The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems

DOI10.1007/11785293_37zbMath1141.90562OpenAlexW2108343387MaRDI QIDQ5757882

Josiah Carlson, David Eppstein

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11785293_37

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

A stronger lower bound on parametric minimum spanning trees ⋮ The Parametric Closure Problem ⋮ Approximating a class of combinatorial problems with rational objective function ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ A stronger lower bound on parametric minimum spanning trees

This page was built for publication: The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems