Efficient Optimization of Monotonic Functions on Trees

DOI10.1137/0604050zbMath0527.05023OpenAlexW2086732333MaRDI QIDQ3043168

Yehoshua Perl, Yossi Shiloach

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604050

zbMATH Keywords

algorithmrooted treeweighting functionsubtreeundirected trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (8)

Best location of service centers in a treelike network under budget constraints ⋮ The shifting algorithm technique for the partitioning of trees ⋮ Finding connected \(k\)-subgraphs with high density ⋮ Solving \(k\)-cluster problems to optimality with semidefinite programming ⋮ The densest \(k\)-subgraph problem on clique graphs ⋮ A shifting algorithm for constrained min-max partition on trees ⋮ A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs ⋮ Clustering and domination in perfect graphs

Cites Work

• Shifting algorithms for tree partitioning with general weighting functions
• Unnamed Item

This page was built for publication: Efficient Optimization of Monotonic Functions on Trees