scientific article; zbMATH DE number 7651148
From MaRDI portal
Publication:5874473
Cites work
- A 3-approximation algorithm for the facility location problem with uniform capacities
- A 5-approximation for capacitated facility location
- A PTAS for the cardinality constrained covering with unit balls
- A constant-factor approximation algorithm for the k-median problem
- A threshold of ln n for approximating set cover
- Almost optimal set covers in finite VC-dimension
- An analysis of the greedy algorithm for the submodular set covering problem
- An approximation algorithm for uniform capacitated \(k\)-median problem with \(1+\epsilon\) capacity violation
- An improved approximation algorithm for vertex cover with hard capacities
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximating \(k\)-median with non-uniform capacities
- Bi-factor approximation algorithms for hard capacitated \(k\)-median problems
- Capacitated covering problems in geometric spaces
- Centrality of trees for capacitated \(k\)-center
- Constant approximation for capacitated \(k\)-median with \((1+\epsilon)\)-capacity violation
- Covering Problems with Hard Capacities
- Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
- How to Allocate Network Centers
- Improved approximation algorithms for capacitated facility location problems
- Improved results on geometric hitting set problems
- Iterative partial rounding for vertex cover with hard capacities
- LP-based algorithms for capacitated facility location
- On uniform capacitated \(k\)-median beyond the natural LP relaxation
- On uniform capacitated \(k\)-median beyond the natural LP relaxation
- The Capacitated K-Center Problem
- Tight algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
- Weighted geometric set cover problems revisited
Cited in
(2)
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 Q5874473)
