scientific article; zbMATH DE number 871893

zbMATH Open0851.65051MaRDI QIDQ4875162FDOQ4875162

Sundar Vishwanathan

Publication date: 26 November 1996

Title of this publication is not available (Why is that?)

Recommendations

• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• scientific article; zbMATH DE number 1757943
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
• Asymmetric k -center is log ^* n -hard to approximate
• Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
• Generalized \(p\)-center problems: Complexity results and approximation algorithms
• scientific article; zbMATH DE number 1285629
• Un nuevo resultado sobre la complejidad del problema delP-centro
• A scalable exact algorithm for the vertex \(p\)-center problem
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem

zbMATH Keywords

algorithmcomplexitydistance matrix\(p\)-center problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Cited In (8)

• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• Title not available (Why is that?)
• Approximation algorithms for Hamming clustering problems
• Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
• Facility location with dynamic distance functions
• Asymmetric \(k\)-center with minimum coverage
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
• Asymmetry in \(k\)-center variants

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