scientific article; zbMATH DE number 6783455

zbMath1377.90076MaRDI QIDQ5365103

Yogish Sabharwal, Barna Saha, Viswanath Nagarajan, Ravishankar Krishnaswamy, Amit Kumar

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133120

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25)

Related Items (21)

New approximation results for resource replication problems ⋮ Matroid and knapsack center problems ⋮ An Improved Approximation Algorithm for Knapsack Median Using Sparsification ⋮ Local search heuristics for the mobile facility location problem ⋮ Constant approximation for fault-tolerant median problems via iterative rounding ⋮ Approximation algorithms for clustering with dynamic points ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ On clustering with discounts ⋮ Approximation Algorithms for Matroid and Knapsack Means Problems ⋮ Approximation algorithms for diversity-bounded center problems ⋮ LP-Based Algorithms for Capacitated Facility Location ⋮ Small Space Stream Summary for Matroid Center ⋮ A Lottery Model for Center-Type Problems with Outliers ⋮ An improved approximation algorithm for knapsack median using sparsification ⋮ Local search algorithms for the red-blue median problem ⋮ Facility location with red-blue demands ⋮ Improved approximation for prize-collecting red-blue median ⋮ A Lottery Model for Center-Type Problems With Outliers ⋮ Constant factor approximation algorithm for uniform hard capacitated knapsack median problem ⋮ Facility Location with Matroid or Knapsack Constraints ⋮ Unnamed Item

This page was built for publication: