![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 95 | Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. SIAM J. Comput. 28(1): 254-262 (1998) | |
| 75 | Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala: Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. STOC 1995: 277-283 |
Selection of 2 from 183 records - Baruch Awerbuch has 111 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page