dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Rakesh V. Vohra (Selection)

Rakesh Vohra

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra: Anonymous monotonic social welfare functions. J. Economic Theory 128(1): 232-254 (2006)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra: Integer Programming and Arrovian Social Welfare Functions. Math. Oper. Res. 28(2): 309-326 (2003)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJay Sethuraman, Chung-Piaw Teo, Rakesh Vohra: Integer Programming and Arrovian Social Welfare Functions. IPCO 2002: 194-211
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: Analysis of LP relaxations for multiway and multicut problems. Networks 34(2): 102-114 (1999)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: On dependent randomized rounding algorithms. Oper. Res. Lett. 24(3): 105-114 (1999)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: On Dependent Randomized Rounding Algorithms. IPCO 1996: 330-344
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. IPCO 1995: 29-39

Selection of 7 from 43 records - Rakesh V. Vohra has 33 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page