scientific article; zbMATH DE number 6297808

zbMath1288.68254MaRDI QIDQ5417729

Ravishankar Krishnaswamy, Nikhil Bansal, Anupam Gupta

Publication date: 22 May 2014

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (11)

A note on the generalized min-sum set cover problem ⋮ Sum-of-squares hierarchy lower bounds for symmetric formulations ⋮ Adaptive Submodular Ranking and Routing ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ Preemptive and non-preemptive generalized min sum set cover ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems ⋮ Unnamed Item ⋮ Approximation algorithms for the geometric firefighter and budget fence problems ⋮ Facility Location with Matroid or Knapsack Constraints ⋮ Precedence-Constrained Min Sum Set Cover ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

This page was built for publication: