scientific article; zbMATH DE number 7651148
From MaRDI portal
Publication:5874473
DOI10.4230/LIPIcs.ESA.2020.9MaRDI QIDQ5874473
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.12454
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A 3-approximation algorithm for the facility location problem with uniform capacities
- Improved results on geometric hitting set problems
- Centrality of trees for capacitated \(k\)-center
- Improved approximation algorithms for capacitated facility location problems
- An analysis of the greedy algorithm for the submodular set covering problem
- A constant-factor approximation algorithm for the \(k\)-median problem
- Almost optimal set covers in finite VC-dimension
- A PTAS for the cardinality constrained covering with unit balls
- An improved approximation algorithm for vertex cover with hard capacities
- A 5-Approximation for Capacitated Facility Location
- WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED
- LP-Based Algorithms for Capacitated Facility Location
- A threshold of ln n for approximating set cover
- An Approximation Algorithm for Uniform Capacitated k-Median Problem 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
- The Capacitated K-Center Problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
- Iterative Partial Rounding for Vertex Cover with Hard Capacities
- On Uniform Capacitated k -Median Beyond the Natural LP Relaxation
- Capacitated Covering Problems in Geometric Spaces
- On Uniform Capacitated k-Median Beyond the Natural LP Relaxation
- Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
This page was built for publication:
