A polynomial algorithm for thep-centdian problem on a tree

DOI10.1002/(SICI)1097-0037(199812)32:4%3C255::AID-NET2%3E3.0.CO;2-OMaRDI QIDQ4540080zbMATH OpenOpenAlexFDO

Authors Arie Tamir, José Pérez, Dionisio Pérez-Brito

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199812)32:4%3C255::aid-net2%3E3.0.co;2-o

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• The Round-Trip p-Center and Covering Problem on a Tree
• scientific article; zbMATH DE number 2081036
• scientific article; zbMATH DE number 1131767
• A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
• Polynomial algorithms to finite Veber problem for a tree network
• \((r,p)\)-centroid problems on paths and trees
• scientific article; zbMATH DE number 1744100
• An O(n^2) algorithm for the characteristic polynomial of a tree
• scientific article; zbMATH DE number 2235064

Cited in

(25)

• Efficient algorithms for two generalized 2-median problems and the group median problem on trees
• The least element property of center location on tree networks with applications to distance and precedence constrained problems
• The centdian subtree on tree networks
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• Revisiting k-sum optimization
• Minimizing the sum of the \(k\) largest functions in linear time.
• The ordered \(k\)-median problem: surrogate models and approximation algorithms
• A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
• A linear time algorithm for connected \(p\)-centdian problem on block graphs
• Efficient points in the biobjective cent-dian problem
• scientific article; zbMATH DE number 4209907 (Why is no real title available?)
• From the median to the generalized center
• scientific article; zbMATH DE number 1323024 (Why is no real title available?)
• Maintaining centdians in a fully dynamic forest with top trees
• The k-centrum multi-facility location problem
• The generalized \(p\)-centdian on network
• Approximability results for the $p$-centdian and the converse centdian problems
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
• Robust vertex centdian facility location problem on tree networks
• Improved complexity results for several multifacility location problems on trees
• Data relaying with constraints in hierarchical sensor networks
• A polynomial algorithm for the multicriteria cent-dian location problem
• Algorithms for central-median paths with bounded length on trees
• A note on the minmax regret centdian location on trees
• The 2-radius and 2-radiian problems on trees

This page was built for publication: A polynomial algorithm for thep-centdian problem on a tree

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