Pages that link to "Item:Q4540080"
From MaRDI portal
The following pages link to A polynomial algorithm for thep-centdian problem on a tree (Q4540080):
Displaying 22 items.
- Maintaining centdians in a fully dynamic forest with top trees (Q479062) (← links)
- Improved complexity results for several multifacility location problems on trees (Q763099) (← links)
- Data relaying with constraints in hierarchical sensor networks (Q857769) (← links)
- A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- A note on the minmax regret centdian location on trees (Q935247) (← links)
- The 2-radius and 2-radiian problems on trees (Q955029) (← links)
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061) (← links)
- The least element property of center location on tree networks with applications to distance and precedence constrained problems (Q1319019) (← links)
- The centdian subtree on tree networks (Q1602695) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
- A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (Q2339828) (← links)
- A linear time algorithm for connected \(p\)-centdian problem on block graphs (Q2672632) (← links)
- Efficient points in the biobjective cent-dian problem (Q2704990) (← links)
- From the median to the generalized center (Q3971961) (← links)
- The generalized \(p\)-centdian on network (Q5937142) (← links)
- Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)
- Robust vertex centdian facility location problem on tree networks (Q6644380) (← links)