S.A. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. of Operations Research, 20:257--301, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
An Implementation of a Combinatorial Approximation.. - Goldberg, Oldham.. (1997) (20 citations) Self-citation (Plotkin) (Correct)
No context found.
Serge A. Plotkin, David B. Shmoys, and ' Eva Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20(2):257--301, May 1995.
Multicommodity Flow Approximation used for - Exact Graph Partitioning (Correct)
No context found.
S.A. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. of Operations Research, 20:257--301, 1995.
Multicommodity Flow Approximation used for - Exact Graph Partitioning (2003) (Correct)
No context found.
S.A. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. of Operations Research, 20:257--301, 1995.
Scheduling over Non-Stationary Wireless Channels with Finite.. - Andrews, Zhang (2004) (Correct)
No context found.
S. Plotkin, D. Shmoys, and E. Tardos, "Fast approximation algorithms for fractional packing and covering problems," Math of Operations Research, vol. 20, pp. 257--301, 1995.
A Scalable Algorithm for the Minimum Expected Cost.. - Lisa Fleischer Adam (Correct)
No context found.
S. A. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257-301, 1995.
On the Number of Iterations for Dantzig-Wolfe Optimization and .. - Klein, Young (2002) (6 citations) (Correct)
No context found.
S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257--301, 1995.
A Scalable Algorithm for the Minimum Expected Cost .. - Fleischer.. (2003) (Correct)
No context found.
S. Plotkin, D. B. Shmoys, E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math. of Oper. Res. 20: 257-301, 1995.
Approximating Fractional Multicommodity Flow Independent of the.. - Fleischer (1999) (27 citations) (Correct)
No context found.
S. A. Plotkin, D. Shmoys, and ' E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257--301, 1995.
Asymptotic Analysis of the Flow Deviation Method for the.. - Bienstock, Raskina (2000) (Correct)
No context found.
S. Plotkin, D.B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math. of Oper. Res. 20 (1995) 495 - 504. Extended abstract: Proc. 32nd Annual IEEE Symp. On Foundations of Computer Science, (1991), 495 - 504.
Approximation algorithms for semidefinite packing.. - Iyengar, Phillips, Stein (2004) (Correct)
No context found.
S. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257--301, 1995.
Concurrent Flows in O*(1/ε) iterations - Bienstock, Iyengar (2004) (Correct)
No context found.
S. Plotkin, D.B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math. of Oper. Res. 20 (1995), 495 -- 504.
Global Optimization Using Local Information with.. - Bartal, Byers, Raz (1997) (19 citations) (Correct)
No context found.
S. Plotkin, D. Shmoys and E. Tardos. Fast Approximation Algorithms for Fractional Packing and Covering Problems. Technical Report ORIE-999 of the School of Operations Research and Industrial Engineering, Cornell University, 1995. Proof of Fact 4 We have to prove that e fl/. Substituting / F for / and multiplying by e
Scheduling over Non-Stationary Wireless Channels with Finite.. - Andrews, Zhang (2004) (Correct)
No context found.
S. Plotkin, D. Shmoys, and E. Tardos, "Fast approximation algorithms for fractional packing and covering problems," Math of Operations Research, vol. 20, pp. 257--301, 1995.
Combinatorial Approximation Algorithms for Generalized Flow.. - Oldham (4 citations) (Correct)
No context found.
Serge A. Plotkin, David B. Shmoys, and Eva Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20(2):257--301, May 1995.
Approximating Minimum Feedback Sets and Multicuts in.. - Even, Naor, Schieber.. (1998) (37 citations) (Correct)
No context found.
S. Plotkin, D. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 20:257--301, 1995.
A Distributed Algorithm for Bandwidth Allocation In.. - Chaudet, Lassous.. (2004) (Correct)
No context found.
Plotkin, S.A., Schmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics Of Operations Research 20 (1995) 257--301
Approximating Disjoint-Path Problems Using Packing Integer.. - Kolliopoulos, Stein (1998) (1 citation) (Correct)
No context found.
S. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257-301, 1995.
Expander Flows, Geometric Embeddings and Graph Partitioning - Arora, Rao, Vazirani (Correct)
No context found.
S. Plotkin and D. B. Shmoys and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Operations Res. 20:257-301, 1995.
Scheduling Malleable Parallel Tasks: An Asymptotic Fully.. - Jansen (Correct)
No context found.
S.A. Plotkin, D.B. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 20 (1995), 257-301.
A Distributed Algorithm for Bandwidth Allocation In.. - Chaudet, Lassous.. (2003) (Correct)
No context found.
Serge A. Plotkin, David B. Schmoys, and Eva Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics Of Operations Research, 20:257--301, 1995.
Faster and Simpler Algorithms for Multicommodity Flow and.. - Garg, Könemann (1997) (64 citations) (Correct)
No context found.
S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res., 20:257--301, 1995.
Approximating Covering Integer Programs with Multiplicity.. - Kolliopoulos (2000) (Correct)
No context found.
S. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257-301, 1995.
An Approximation Algorithm for the Multicast Congestion.. - Jansen, Zhang (2002) (3 citations) (Correct)
No context found.
S. A. Plotkin, D. B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 2 (1995), 257-301.
Approximation Algorithms for Disjoint Paths Problems - Kleinberg (1996) (62 citations) (Correct)
No context found.
S. Plotkin, D. Shmoys, ' E. Tardos, "Fast approximation algorithms for fractional packing and covering problems," Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991.
Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (2 citations) (Correct)
No context found.
S. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257--301, 1995.
First 50 documents Next 50
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