The Prize-collecting Call Control Problem on Weighted Lines and Rings
From MaRDI portal
Publication:2798111
DOI10.1051/ro/2015010zbMath1333.90110OpenAlexW2018919524MaRDI QIDQ2798111
Yaomin Shi, Jianping Li, Weidong Li, Li Guan
Publication date: 1 April 2016
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2015010
Related Items (2)
The bound coverage problem by aligned disks in \(L_1\) metric ⋮ Online semi-matching problem with two heterogeneous sensors in a metric space
Cites Work
- Unnamed Item
- Minimal multicut and maximal integer multiflow: a survey
- Approximation algorithms for the unsplittable flow problem
- Call control in rings
- Min sum clustering with penalties
- On the \(k\)-coloring of intervals
- Combinatorial algorithms for the unsplittable flow problem
- A quasi-PTAS for unsplittable flow on line graphs
- Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
- An improved approximation algorithm for resource allocation
- Multicommodity demand flow in a tree and packing integer programs
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
- A logarithmic approximation for unsplittable flow on line graphs
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: The Prize-collecting Call Control Problem on Weighted Lines and Rings
