Suche Bilder Maps Play YouTube News Gmail Drive Mehr »
Anmelden
Books Bücher 1 - 10 von 11 in M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2.
" M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. "
Approximation Algorithms - Seite 358
von Vijay V. Vazirani - 2002 - 380 Seiten
Eingeschränkte Leseprobe - Über dieses Buch

STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science ...

Alain Finkel - 1992 - 620 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....
Eingeschränkte Leseprobe - Über dieses Buch

Graph-Theoretic Concepts in Computer Science: 17th International Workshop WG ...

Gunther Schmidt, Rudolf Berghammer - 1992 - 252 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]...
Eingeschränkte Leseprobe - Über dieses Buch

Randomization and Approximation Techniques in Computer Science ...

1997 - 225 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...
Eingeschränkte Leseprobe - Über dieses Buch

Complexity and Approximation: Combinatorial Optimization Problems and Their ...

Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi - 1999 - 524 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...
Eingeschränkte Leseprobe - Über dieses Buch

Advances in Steiner Trees

Ding-Zhu Du, J.M. Smith, J. Hyam Rubinstein - 2000 - 323 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...
Eingeschränkte Leseprobe - Über dieses Buch

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms

2003 - 874 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...
Eingeschränkte Leseprobe - Über dieses Buch

Spanning Trees and Optimization Problems

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...
Eingeschränkte Leseprobe - Über dieses Buch

Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005 ...

Sotiris Nikoletseas - 2005 - 624 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...
Eingeschränkte Leseprobe - Über dieses Buch

STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science ...

Bruno Durand - 2006 - 714 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,...
Eingeschränkte Leseprobe - Über dieses Buch

Theory and Applications of Models of Computation: 4th International ...

Jin-Yi Cai, S. Barry Cooper - 2007 - 772 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...
Eingeschränkte Leseprobe - Über dieses Buch




  1. Meine Bücher
  2. Hilfe
  3. Erweiterte Buchsuche