 | Alain Finkel, Matthias Jantzen - 1992 - 644 Seiten
...of Computer Science, pages 256-268. SpringerVerlag, 1989. Lecture Notes in Computer Science 349. [3] M. Bern and P. Plassmann. The Steiner problem with...Information Processing Letters, 32:171-176, 1989. [4] A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis. Linear approximation of shortest superstrings.... | |
 | Gunther Schmidt, Rudolf Berghammer - 1992 - 268 Seiten
...and G. Reich for helpful discussions and critical comments. References [BP89] Marshall Bern and Paul Plassmann. The Steiner problem with edge lengths 1...Information Processing Letters, 32:171-176, 1989. [Gab85] HN Gabow. Scaling algorithms for network problems. J. Comp. Sys. Sc., 31:148-168, 1985. [GJ79]... | |
 | Jose Rolim - 1997 - 240 Seiten
...Verification and Hardness of Approximation Problems, Proc. 33rd IEEE FOCS (1992), pp. 14-20. [BP89] M. Bern and P. Plassmann, The Steiner Problem with Edge Lengths 1 and 2, Inform. Process. Lett. 32 (1989), pp. 171-176. [B86] AZ Broder, How Hard is it to Marry at Random (On... | |
 | Giorgio Ausiello - 1999 - 554 Seiten
...Information and Computation 96, 77-94. (GT28. GT50, SR7, MP2, LO12, AL2) Bern, M., and Plassmann, P. (1989), "The Steiner problem with edge lengths 1 and 2", Information Processing Letters 32, 171-176. (ND8) Bernstein, D., Rodeh, M., and Gertner, I. (1989), "Approximation algorithms for... | |
 | Ding-Zhu Du, J.M. Smith, J. Hyam Rubinstein - 2000 - 344 Seiten
...approximations for the Steiner tree problem. Journal of Algorithms Vol. 17 (1994) pp. 381-408. [8] M. Bern and P. Plassmann, The Steiner problem with...edge lengths 1 and 2, Information Processing Letters Vol. 32 (1989) pp. 171-176. [9] G.-H. Chen, ME Houle and MT Kuo, The Steiner problem in distributed... | |
 | 2003 - 896 Seiten
...increasing local edge-connectivity in mixed graphs. SIAM J. Discrete Math., 8(2):155-178, 1995. [3] M. Bern and P. Plassmann. The Steiner problem with...edge lengths 1 and 2. Information Processing Letters, 32(4):171-176, 1989. [4] B. Carr and S. Vempala. Randomized meta-rounding. Proc. of the 32nd ACM Symposium... | |
 | Bang Ye Wu, Kun-Mao Chao - 2004 - 200 Seiten
...Ramaiyer. Improved approximations for the Steiner tree problem. J. Algorithms, 17(3):381-408, 1994. [12] M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett., 32(4):171-176, 1989. 175 [13] K. Bharath-Kumar and JM Jaffe. Routing to multiple... | |
 | Sotiris Nikoletseas - 2005 - 637 Seiten
...implementation versus theory, Proceedings of the 5th Conference on Algorithms and Complexity, CIAC 2003. 5. M. Bern and P. Plassmann, The Steiner problem with edge lengths 1 and 2, Information Professing Letters, 32 (1989), 171-176. 6. R. Carr and S. Vempala, Randomized meta-rounding, Proceedings... | |
 | Bruno Durand - 2006 - 730 Seiten
...maximum independent sets in sparse and general graphs. In Proc. of 10th SODA, pages 856-857, 1999. 2. M. Bern and P. Plassmann. The Steiner problem with...Information Processing Letters, 32:171-176, 1989. 3. SE Dreyfus and RA Wagner. The Steiner problem in graphs. Networks, 1:195207, 1972. 4. FV Fomin,... | |
 | Jin-Yi Cai - 2007 - 784 Seiten
...approximation problems," Journal of the Association for Computing Machinery, vol. 45, pp. 501-555, 1998. 2. M. Bern and P. Plassmann, "The Steiner problem with...lengths 1 and 2," Information Processing Letters, vol. 32(4), pp. 171—176, 1989. 3. X. Cheng and DZ Du, Steiner Trees in Industry, Kluwer Academic... | |
| |
M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. 
