✦ LIBER ✦
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
✍ Scribed by Keizo Miyata; Shigeru Masuyama; Shin-ichi Nakayama; Liang Zhao
- Book ID
- 108112599
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 309 KB
- Volume
- 154
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.