Computing the 2‐median on tree networks in O(n lg n) time
From MaRDI portal
Publication:4894868
DOI10.1002/net.3230260413zbMath0856.90065MaRDI 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
90C60: Abstract computational complexity for mathematical programming problems
90B18: Communication networks in operations research
90B80: Discrete location and assignment
Related Items
Efficient algorithms for centers and medians in interval and circular-arc graphs, The backup 2‐center and backup 2‐median problems on trees, Optimal algorithms for selective variants of the classical and inverse median location problems on trees, Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights, Efficient algorithms for finding <scp>2‐medians</scp> of a tree, The connected \(p\)-median problem on block graphs, The backup 2-median problem on block graphs, Inverse \(p\)-median problems with variable edge lengths, Median problems with positive and negative weights on cycles and cacti, A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint, The 2-radius and 2-radiian 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, The multi-service center problem, On discrete preferences and coordination, Finding an optimal core on a tree network with M/G/c/c state-dependent queues, Finding a core of a tree with pos/neg weight, Classical and inverse median location problems under uncertain environment, A combinatorial algorithm for the ordered 1-median problem on cactus graphs, Median problems on wheels and cactus graphs, The balanced 2-median and 2-maxian problems on a tree, Unnamed Item
Cites Work
