New approximation results for resource replication problems

DOI10.1007/s00453-015-9978-9zbMath1333.68295OpenAlexW2292989938MaRDI QIDQ270001

Kanthi K. Sarpatwar, Samir Khuller, Barna Saha

Publication date: 6 April 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-9978-9

zbMATH Keywords

approximation algorithmshardness of approximationresource replication problems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Clustering to minimize the maximum intercluster distance
• Approximating the domatic number
• Approximation Algorithms for Data Placement Problems
• A robust maximum completion time measure for scheduling
• Scheduling with Outliers
• A Best Possible Heuristic for the k-Center Problem
• How to Allocate Network Centers
• The Capacitated K-Center Problem
• Bottleneck extrema
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New approximation results for resource replication problems