![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 4 | Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson: Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements. WAOA 2008: 174-187 | |
| 2 | Yogeshwer Sharma, David P. Williamson: Stackelberg thresholds in network routing games or the value of altruism. ACM Conference on Electronic Commerce 2007: 93-102 | |
| 1 | Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson: Approximation algorithms for prize collecting forest problems with submodular penalty functions. SODA 2007: 1275-1284 |
Selection of 3 from 6 records - Yogeshwer Sharma has 7 coauthors
Copyright © 2009-12-31 by Michael Ley (ley@uni-trier.de)