scientific article
From MaRDI portal
Publication:2921761
zbMath1297.68023MaRDI QIDQ2921761
Chaitanya Swamy, Ara Hayrapetyan, Éva Tardos
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Discrete location and assignment (90B80) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (27)
The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem ⋮ Approximation and complexity of multi-target graph search and the Canadian traveler problem ⋮ An improved approximation algorithm for squared metric \(k\)-facility location ⋮ An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties ⋮ An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties ⋮ Equivalence of convex minimization problems over base polytopes ⋮ Better guarantees for \(k\)-median with service installation costs ⋮ An approximation algorithm for the dynamic facility location problem with submodular penalties ⋮ Approximation algorithms for the fault-tolerant facility location problem with submodular penalties ⋮ A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties ⋮ A primal-dual approximation algorithm for the facility location problem with submodular penalties ⋮ Approximation algorithms for the priority facility location problem with penalties ⋮ Unnamed Item ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Unnamed Item ⋮ Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties ⋮ Online constrained forest and prize-collecting network design ⋮ Elementary approximation algorithms for prize collecting Steiner tree problems ⋮ A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements ⋮ Improved approximation algorithms for the facility location problems with linear/submodular penalties ⋮ A note on the subadditive network design problem ⋮ Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties ⋮ Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems ⋮ Unnamed Item ⋮ New approximations and hardness results for submodular partitioning problems
This page was built for publication:
