Bruce Shepherd, Adrian Vetta  Home/Search
Context Related
| belllabs.com/cm/ms/who/bshep/P...dm.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/cm/ms/who/bsh...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 2 2 and at most 2 5 . For general... (Update)
Cited by: More
Multicommodity Demand Flow in a Tree and Packing Integer.. - Chekuri, Mydlarz, Shepherd (2003) (Correct)
Active bibliography (related documents): More All
0.8: The Demand Matching Problem - Shepherd, Vetta (2003) (Correct)
0.1: Approximating Disjoint-Path Problems Using Packing Integer.. - Kolliopoulos, Stein (1998) (Correct)
0.1: Integer Programming - Chandru, Rao (1998) (Correct)
Similar documents based on text: More All
0.2: A Cycle Augmentation Algorithm for Minimum Cost.. - Shepherd, Zhang (Correct)
0.2: Route Oscillations in I-BGP with Route Reflection - Basu, Ong, Rasala, Shepherd, .. (2002) (Correct)
0.2: Directed Network Design with Orientation Constraints - Khanna, Naor, Shepherd (2000) (Correct)
BibTeX entry: (Update)
F.B. Shepherd, A. Vetta. The Demand Matching Problem. Proc. of IPCO, 2002. http://citeseer.ist.psu.edu/shepherd02demand.html More
@misc{ shepherd02demand,
author = "F. Shepherd and A. Vetta",
title = "The Demand Matching Problem",
text = "F.B. Shepherd, A. Vetta. The Demand Matching Problem. Proc. of IPCO, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/shepherd02demand.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
151 Algorithms and Applications (context) - Ahuja, Magnanti et al. - 1993
77 An approximation algorithm for the generalized assignment pr.. (context) - Shmoys, Tardos - 1993
70 Primal-Dual Approximation Algorithms for Integral Flow and M.. (context) - Garg, Vazirani et al. - 1997
60 On some tighter inapproximability results - Berman, Karpinksi - 1999
28 the Single-Source Unsplittable Flow Problem - Dinitz, Garg et al. - 1999
24 Integral boundary points of convex polyhedra (context) - Ho, Kruskal - 1956
22 Non-approximability Results for Optimization Problems on Bou.. - Trevisan - 2001
18 A PTAS for the Multiple Knapsack Problem - Chekuri, Khanna - 2000
15 Fast approximation for the knapsack and sum of subset proble.. (context) - Ibarra, Kim - 1975
13 Personal Communication (context) - Chekuri - 2000
8 Maximum matching and a polyhedron with 0; 1-vertices (context) - Edmonds - 1965
6 Single-source unsplittable ow (context) - Kleinberg - 1996
6 Approximation algorithms for the unsplittable ow problem (context) - Chakrabarti, Chekuri et al. - 2001
Documents on the same site (http://cm.bell-labs.com/cm/ms/who/bshep/pub.html): More
The Stable Paths Problem and Interdomain Routing - Griffin, Shepherd, Wilfong (Correct)
Near-Optimal Hardness Results and Approximation.. - Guruswami.. (1999) (Correct)
Some Strategies for Reserving Resilient Capacity - Brightwell, Oriolo, Shepherd (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC