Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms (TALG)
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
We examine formulations for the well-known b-matching problem in the presence of integer demands on the edges. A subset M of edges is feasible if for each node v, the total demand of edges in M incident to it is at most bv. We examine the system of star inequalities for this problem. This system yields an exact linear description for b- matchings in bipartite graphs. For the demand version, we show that the integrality gap for this system is at least 21/2 and at most 2 13/16. For general graphs, the gap lies between 3 and 3 5/16. A fully polynomial approximation scheme is also presented for the problem on a tree, thus generalizing a well-known result for the knapsack problem.