scientific article; zbMATH DE number 1285629

MaRDI QIDQ4242386zbMATH OpenFDO

Authors Maxim Sviridenko

Publication date 10 May 1999

zbMATH Keywords

\(p\)-center problemtime complexitytriangle inequality

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The p-neighbor k-center problem
• scientific article; zbMATH DE number 34574
• A heuristic for the p-center problem in graphs
• The p-Centre Problem-Heuristic and Optimal Algorithms

Cited in

(9)

• Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
• The p-neighbor k-center problem
• scientific article; zbMATH DE number 4135317 (Why is no real title available?)
• scientific article; zbMATH DE number 39101 (Why is no real title available?)
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• scientific article; zbMATH DE number 871893 (Why is no real title available?)
• On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
• A relaxation-based algorithm for solving the conditional \(p\)-center problem

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 Q4242386)