Efficient Optimization of Monotonic Functions on Trees

DOI10.1137/0604050MaRDI QIDQ3043168zbMATH OpenOpenAlexFDO

Authors 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 treesubtreeundirected treesweighting function

Mathematics Subject Classification ID

Trees (05C05)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Shifting algorithms for tree partitioning with general weighting functions

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043168)