scientific article; zbMATH DE number 1286021

MaRDI QIDQ4242567zbMATH OpenFDO

Authors Maxim Sviridenko

Publication date 11 May 1999

zbMATH Keywords

\(p\)-median problemapproximate polynomial algorithminteger-valued problemprobability approximation of the optimal solution

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the probabilistic analysis of an approximation algorithm for solving the \(p\)-median problem
• Approximate solution of the \(p\)-median minimization problem
• A dynamic programming heuristic for the \(P\)-median problem
• A Langrangean heuristic for the \(p_ k\)-median dynamic location problem

Cited in

(6)

• A dynamic programming heuristic for the \(P\)-median problem
• An improved approximation algorithm for the prize-collecting red-blue median problem
• On the probabilistic analysis of an approximation algorithm for solving the \(p\)-median problem
• Sequential zone adjustment for approximate solving of large p-median problems
• Approximate solution of the \(p\)-median minimization problem
• A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242567)