scientific article; zbMATH DE number 7053370

zbMath1422.68008arXiv1110.4150MaRDI QIDQ5743493

Siddharth Barman, Shuchi Chawla

Publication date: 10 May 2019

Full work available at URL: https://arxiv.org/abs/1110.4150

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for geometric median problems
• Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs
• Cost-Distance: Two Metric Network Design
• Simpler and better approximation algorithms for network design
• Universal approximations for TSP, Steiner tree, and set cover
• A tight bound on approximating arbitrary metrics by tree metrics
• Facility location with hierarchical facility costs

This page was built for publication: