P.Raghavan, Probabilistic construction of deterministic algorithms: Approxiamting packing integer programs, Journal of Computer and System Sciences 37 (1988) 130-143. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Unknown - (Correct)
No context found.
P.Raghavan, Probabilistic construction of deterministic algorithms: Approxiamting packing integer programs, Journal of Computer and System Sciences 37 (1988) 130-143.
An Approximation Algorithm for the Disjoint Paths Problem in.. - Kleinberg (2005) (62 citations) (Correct)
No context found.
P. Raghavan, "Probabilistic construction of deterministic algorithms: approximating packing integer programs, " J. Computer and System Sciences, 37(1988).
Disjoint Paths in Densely Embedded Graphs - Jon Kleinberg Eva (Correct)
No context found.
P. Raghavan, "Probabilistic construction of deterministic algorithms: approximating packing integer programs," J. Computer and System Sciences, 37(1988), pp. 130--143.
Faster Approximation Algorithms for the Unit Capacity.. - Klein, Plotkin, al. (1991) (44 citations) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pages 10--18, 1986.
On-Line Randomized Call Control Revisited - Leonardi, Marchetti-Spaccamela, .. (2001) (15 citations) (Correct)
No context found.
P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer program, J. Comput. System Sci., 2 (1988), pp. 130--143.
Load Balanced Short Path Routing in Wireless Networks - Gao, Zhang (2004) (1 citation) (Correct)
No context found.
P. Raghavan, "Probabilistic construction of deterministic algorithms: approximating packing integer programs," J. Comp. and System Sciences, pp. 130--143, 1988.
Derandomization by Exploiting Redundancy - And Mutual Independence (Correct)
No context found.
. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. JCSS 37:4, Oct. 1988, 130-143.
Parallel Derandomization Techniques - Yijie Han Department (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. JCSS 37:4, Oct. 1988, 130-143.
A Fast Derandomization Scheme and Its Applications - Yijie Han Department (1996) (1 citation) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. JCSS 37:4, Oct. 1988, 130-143.
Approximation Algorithms for Data Placement on.. - Golubchik, Khanna.. (2000) (10 citations) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, pages 130--143, 1988.
Simultaneous Optimization for Concave Costs: Single Sink.. - Goel, Estrin (2003) (184 citations) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer problems. Journal of Comp. Sys. Sci., 37:130--43, 1988.
Splitters and Near-Optimal Derandomization - Naor, Schulman, Srinivasan (1995) (14 citations) (Correct)
No context found.
P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer and System Sciences 37 (1988), pp. 130--143.
Approximating Disjoint-Path Problems Using Packing Integer.. - Kolliopoulos, Stein (1998) (1 citation) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37:130-143, 1988.
Approximations for the Disjoint Paths Problem in.. - Kleinberg, Tardos (1995) (28 citations) (Correct)
No context found.
P. Raghavan, "Probabilistic construction of deterministic algorithms: approximating packing integer programs," J. Computer and System Sciences, 37(1988), pp. 130--143. 22
Approximation Algorithms for Single-Source Unsplittable Flow - Kolliopoulos, Stein (1997) (2 citations) (Correct)
No context found.
P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer and System Sciences, 37 (1988), pp. 130-143.
A Combinatorial Approximation Algorithm for the.. - Coudert, Rivano, Roche (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithm: Approximating packing integer programs. Journal of Computer and Systems Sciences, 38:683707, 1994.
An Approximation Algorithm for the Multicast Congestion.. - Jansen, Zhang (2002) (3 citations) (Correct)
No context found.
P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, Journal of Computer and System Science, 37 (1988), 130-143.
Approximation Algorithms for Disjoint Paths Problems - Kleinberg (1996) (62 citations) (Correct)
No context found.
P. Raghavan, "Probabilistic construction of deterministic algorithms: approximating packing integer programs," J. Computer and System Sciences, 37(1988), pp. 130--143.
Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (2 citations) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37:130--143, 1988. 130
A Tight Bound on Approximating Arbitrary Metrics by Tree.. - Fakcharoenphol, Rao.. (2003) (14 citations) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37(2):130--143, Oct. 1988.
Approximate Multicommodity Flow for WDM Networks Design - Bouklit, Coudert.. (2003) (Correct)
No context found.
RAGHAVAN, P. Probabilistic construction of deterministic algorithm: Approximating packing integer programs. Journal of Computer and Systems Sciences 38 (1994), 683--707. 10
New 3/4-Approximation Algorithms for MAX SAT - Goemans, Williamson (1994) (13 citations) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37:130--143, 1988.
Flows on Few Paths: Algorithms and Lower Bounds - Martens, Skutella (2004) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37, pages 130--143, 1988.
On-line Randomized Call Control Revisited - Stefano Leonardi Alberto (1998) (15 citations) (Correct)
No context found.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer program. Journal of Computer and Systems Sciences, 2(37):130--143, 1988.
On-line Resource Management with Application to.. - Leonardi.. (1995) (7 citations) (Correct)
No context found.
P. Raghavan, "Probabilistic construction of deterministic algorithms: approximating packing integer programs", Journal of Computer and System Science 37, pp. 130-143, 1988.
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