Computing the 2‐median on tree networks in O(n lg n) time
From MaRDI portal
Publication:4894868
DOI10.1002/net.3230260413zbMath0856.90065OpenAlexW2103145733MaRDI QIDQ4894868
Publication date: 13 November 1996
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230260413
Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Related Items (22)
A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ Efficient algorithms for centers and medians in interval and circular-arc graphs ⋮ The connected \(p\)-median problem on block graphs ⋮ Median problems with positive and negative weights on cycles and cacti ⋮ The multi-service center problem ⋮ On discrete preferences and coordination ⋮ Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights ⋮ The backup 2-median problem on block graphs ⋮ Finding a core of a tree with pos/neg weight ⋮ Efficient algorithms for finding <scp>2‐medians</scp> of a tree ⋮ The balanced 2-median and 2-maxian problems on a tree ⋮ Unnamed Item ⋮ Finding an optimal core on a tree network with M/G/c/c state-dependent queues ⋮ Median problems on wheels and cactus graphs ⋮ Classical and inverse median location problems under uncertain environment ⋮ The 2-radius and 2-radiian problems on trees ⋮ Inverse \(p\)-median problems with variable edge lengths ⋮ The backup 2‐center and backup 2‐median problems on trees ⋮ Efficient algorithms for two generalized 2-median problems and the group median problem on trees ⋮ A polynomial method for the pos/neg weighted 3-median problem on a tree ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ A combinatorial algorithm for the ordered 1-median problem on cactus graphs
Cites Work
This page was built for publication: Computing the 2‐median on tree networks in O(n lg n) time
