New Approximation Results for Resource Replication Problems
From MaRDI portal
Publication:3167398
DOI10.1007/978-3-642-32512-0_19zbMath1333.68294OpenAlexW2401192975MaRDI QIDQ3167398
Kanthi K. Sarpatwar, Barna Saha, Samir Khuller
Publication date: 2 November 2012
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32512-0_19
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
Matroid and knapsack center problems ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems
This page was built for publication: New Approximation Results for Resource Replication Problems