A polynomial time algorithm for finding the absolute center of a network

DOI10.1002/net.3230110404zbMath0738.90045OpenAlexW1980170589MaRDI QIDQ4000529

Edward Minieka

Publication date: 20 September 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230110404

zbMATH Keywords

polynomial time algorithmabsolute center of a network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items (8)

Biobjective center – balance graph location model^* ⋮ An \(O(mn)\) algorithm for the anti-cent-dian problem ⋮ Location and layout planning. A survey ⋮ The biobjective absolute center problem ⋮ The absolute center of a unicyclic network ⋮ An algorithm for finding the absolute center of a network ⋮ Some new algorithms for location problems on networks ⋮ Discrete Center Problems

Cites Work

• Unnamed Item

This page was built for publication: A polynomial time algorithm for finding the absolute center of a network