Asymptotic approach to the problem of \(k\)-median of a graph

DOI10.1007/BF02367754zbMath0838.90124MaRDI QIDQ1905205

N. E. Efimchik, Vladimir A. Emelichev

Publication date: 30 May 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

edge-weighted graph\(k\)-median problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem ⋮ Asymptotic optimality of a transport-problem plan constructed by the minimum-element method

Cites Work

• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic approach to the problem of \(k\)-median of a graph