scientific article; zbMATH DE number 7651176
From MaRDI portal
Publication:5874506
DOI10.4230/LIPIcs.ESA.2020.37MaRDI QIDQ5874506
Shichuan Deng, Jian Li, Yuval Rabani
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid and knapsack center problems
- New approaches to multi-objective optimization
- Fault tolerant \(K\)-center problems
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- A Dependent LP-Rounding Approach for the k-Median Problem
- Minimizing movement
- Minimizing movement in mobile facility location problems
- Dependent rounding and its applications to approximation algorithms
- Reducibility Among Combinatorial Problems
- A Best Possible Heuristic for the k-Center Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximating capacitated k-median with (1 + ∊)k open facilities
- Local Search Heuristics for k-Median and Facility Location Problems
- A Constant Factor Approximation Algorithm for Fault-Tolerant k -Median
- Dynamic Facility Location via Exponential Clocks
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Fault-tolerant facility location
- A Lottery Model for Center-Type Problems With Outliers
- Facility Location in Evolving Metrics
- Approximation algorithms for minimum norm and ordered optimization problems
- Constant-factor approximation for ordered k-median
- Approximating k-median via pseudo-approximation
- Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)
This page was built for publication:
