Polynomial algorithms to finite Veber problem for a tree network

DOI10.1016/0377-0427(91)90215-6zbMath0746.05034OpenAlexW2091907362MaRDI QIDQ1176800

Boris V. Pelzwerger, A. V. Panyukov

Publication date: 25 June 1992

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(91)90215-6

zbMATH Keywords

complexitypolynomial algorithmstree networkVeber problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Algorithm for the discrete Weber's problem with an accuracy estimate ⋮ Solving a maximin location problem on the plane with given accuracy ⋮ Unnamed Item ⋮ On the existence of an integer solution to the relaxed Weber problem for a tree network

Uses Software

• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• On the One-Dimensional Space Allocation Problem
• A Theorem on Boolean Matrices

This page was built for publication: Polynomial algorithms to finite Veber problem for a tree network