-
2
-
-
25344450320
-
Branching processes
-
Department of Statistics, University of Georgia
-
K. Athreya and A. Vidyashankar. Branching processes. Technical Report TR-99-16, Department of Statistics, University of Georgia, 1999.
-
(1999)
Technical Report
, vol.TR-99-16
-
-
Athreya, K.1
Vidyashankar, A.2
-
3
-
-
0000927271
-
An O(log k) approximate min-cut max-flow theorem and approximation algorithm
-
Feb.
-
Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, Feb. 1998.
-
(1998)
SIAM Journal on Computing
, vol.27
, Issue.1
, pp. 291-301
-
-
Aumann, Y.1
Rabani, Y.2
-
4
-
-
0042599311
-
Meet and merge: Approximation algorithms for confluent flows
-
College of Computer & Information Science, Northeastern University, March
-
J. Chen, R. Rajaraman, and R. Sundaram. Meet and merge: Approximation algorithms for confluent flows. Technical report, College of Computer & Information Science, Northeastern University, March 2003.
-
(2003)
Technical Report
-
-
Chen, J.1
Rajaraman, R.2
Sundaram, R.3
-
6
-
-
0034408816
-
Broadcasting on trees and the ising model
-
W. Evans, C. Kenyon, Y. Peres, and L. Schulman. Broadcasting on trees and the ising model. Annals of Applied Probability, 10:410-433, 2000.
-
(2000)
Annals of Applied Probability
, vol.10
, pp. 410-433
-
-
Evans, W.1
Kenyon, C.2
Peres, Y.3
Schulman, L.4
-
12
-
-
0034832757
-
Provisioning a virtual private network: A network design problem for multicommodity flow
-
A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener. Provisioning a virtual private network: A network design problem for multicommodity flow. In STOC: ACM Symposium on Theory of Computing, 2001.
-
(2001)
STOC: ACM Symposium on Theory of Computing
-
-
Gupta, A.1
Kleinberg, J.2
Kumar, A.3
Rastogi, R.4
Yener, B.5
-
13
-
-
0043100185
-
Bounded branching process and AND/OR tree evaluation
-
R. Karp and Y. Zhang. Bounded branching process and AND/OR tree evaluation. Random Structures & Algorithms, 7:97-116, 1995.
-
(1995)
Random Structures & Algorithms
, vol.7
, pp. 97-116
-
-
Karp, R.1
Zhang, Y.2
-
14
-
-
21144482001
-
Designing multi-commodity flow trees
-
F. K. H. A. Dehne, J.-R. Sack, N. Santoro, and S. Whitesides, editors, Montréal, Canada, Aug. Springer
-
S. Khuller, B. Raghavachari, and N. Young. Designing multi-commodity flow trees. In F. K. H. A. Dehne, J.-R. Sack, N. Santoro, and S. Whitesides, editors, Proceedings of the 3rd Workshop on Algorithms and Data Structures, volume 709 of Lecture Notes in Computer Science, pages 433-441, Montréal, Canada, Aug. 1993. Springer.
-
(1993)
Proceedings of the 3rd Workshop on Algorithms and Data Structures, Volume 709 of Lecture Notes in Computer Science
, vol.709
, pp. 433-441
-
-
Khuller, S.1
Raghavachari, B.2
Young, N.3
-
17
-
-
0036106499
-
An approximation algorithm for the covering steiner problem
-
Special Issue on Probabilistic Methods in Combinatorial Optimization
-
G. Konjevod, R. Ravi, and A. Srinivasan. An approximation algorithm for the covering steiner problem. Random Structures & Algorithms, 20:465-48, 2002. Special Issue on Probabilistic Methods in Combinatorial Optimization.
-
(2002)
Random Structures & Algorithms
, vol.20
, pp. 465-548
-
-
Konjevod, G.1
Ravi, R.2
Srinivasan, A.3
-
18
-
-
0034780880
-
Algorithms for provisioning virtual private networks in the hose model
-
Aug.
-
A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener. Algorithms for provisioning virtual private networks in the hose model. In Proceedings of the ACM SIGCOMM 2001 Conference, volume 31 of Computer Communication Review, pages 135-148, Aug. 2001.
-
(2001)
Proceedings of the ACM SIGCOMM 2001 Conference, Volume 31 of Computer Communication Review
, vol.31
, pp. 135-148
-
-
Kumar, A.1
Rastogi, R.2
Silberschatz, A.3
Yener, B.4
-
19
-
-
0000651166
-
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
-
T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM: Journal of the ACM, 46, 1999.
-
(1999)
JACM: Journal of the ACM
, vol.46
-
-
Leighton, T.1
Rao, S.2
-
20
-
-
0000652415
-
The geometry of graphs and some of its algorithmic applications
-
N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
-
(1995)
Combinatorica
, vol.15
, pp. 215-245
-
-
Linial, N.1
London, E.2
Rabinovich, Y.3
-
21
-
-
0043100189
-
How good can IP routing be?
-
DIMACS, Apr.
-
D. Lorenz, A. Orda, D. Raz, and Y. Shavitt. How good can IP routing be? Technical Report 2001-17, DIMACS, Apr. 2001.
-
(2001)
Technical Report
, vol.17
-
-
Lorenz, D.1
Orda, A.2
Raz, D.3
Shavitt, Y.4
-
22
-
-
0003165381
-
Bicriteria network design problems
-
July
-
M. Marathe, R. Ravi, R. Sundaram, S. Ravi, D. Rosenkrantz, and H. Hunt. Bicriteria network design problems. Journal of Algorithms, 28(1):142-171, July 1998.
-
(1998)
Journal of Algorithms
, vol.28
, Issue.1
, pp. 142-171
-
-
Marathe, M.1
Ravi, R.2
Sundaram, R.3
Ravi, S.4
Rosenkrantz, D.5
Hunt, H.6
-
23
-
-
0001035413
-
On the method of bounded differences
-
J. Siemons, editor. Cambridge University Press, Cambridge, UK
-
C. McDiarmid. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics, pages 148-188. Cambridge University Press, Cambridge, UK, 1989.
-
(1989)
Surveys in Combinatorics
, pp. 148-188
-
-
McDiarmid, C.1
-
25
-
-
51249173817
-
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
-
P. Raghavan and C. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7, 1987.
-
(1987)
Combinatorica
, vol.7
-
-
Raghavan, P.1
Thompson, C.2
-
27
-
-
0036346557
-
Hop-by-hop routing algorithms for premium-class traffic in diffserv networks
-
New York, NY, June
-
J. Wang and K. Nahrstedt. Hop-by-hop routing algorithms for premium-class traffic in diffserv networks. In Proc. of IEEE INFOCOM 2002, New York, NY, June 2002.
-
(2002)
Proc. of IEEE INFOCOM 2002
-
-
Wang, J.1
Nahrstedt, K.2
|