Search result, Aladdin Center

Search result for: Ravi all years

	Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, R. Ravi and Russell Schwartz: Comparison of Haplotype Motif and Block Models using the Principle of Minimum Description. Genomic Studies and the HapMap, March 15-18, 2005, University of Oxford, UK PDF
	Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, R. Ravi and Russell Schwartz: Comparison of Haplotype Motif and Block Models using the Principle of Minimum Description. CMU-CS-166 PDF
	Shuchi Chawla, Robert Krauthgamer Ravi Kumar, Yuval Rabani, D. Sivakumar: On the Hardness of Approximating Multicut and Sparsest-Cut. Conference on Computational Complexity 2005 PDF
	Kedar Dhamdhere, R. Ravi, and Mohit Singh: On Two-Stage Stochastic Minimum Spanning Trees. IPCO 2005 PDF
	R. Ravi and Amitabh Sinha: Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. Proceedings of the Conference on Integer Programming and Combinatorial Ortimization (IPCO), (2004) PDF
	R. Ravi and Amitabh Sinha: Boosted Sampling: Approximation Algorithms for Stochastic Optimization. Proceedings of the ACM Symposium on the Theory of Computing (STOC), vol. , (2004), p. 417 PDF
	Shuchi Chawla, Uday Rajan, R. Ravi, and Amitabh Sinha: Worst-Case Payoffs of a Location Game. Proceedings of the ACM Conference on Electronic Commerce, (2004), p. 244 PDF
	Vittorio Bilo, Vineet Goyal, R. Ravi, and Mohit Singh: On the Crossing Spanning Tree Problem. APPROX'04 PDF
	S. Chawla, U. Rajan, R. Ravi, and A. Sinha: Min-Max Payoffs of a Location Game. CMU CS Technical report CMU-CS-03-143; submitted to Games and Economic Behavior, 2003 PDF
	G. Even, N. Garg, J. Konemann, R. Ravi, and A. Sinha: Min-Max Payoffs of a Location Game. CMU CS Technical report CMU-CS-03-143; submitted to Games and Economic Behavior, 2003 PDF
	Kedar Dhamdhere, Anupam Gupta, and R. Ravi: Approximating Average Distortion of Embeddings into Line. DIMACS Workshop on Discrete Metric Spaces and their Algorithmic Applications PDF / abs
	S.Chawla, D. Kitchin, U. Rajan, R. Ravi and A. Sinha: Profit guaranteeing mechanisms for multicast networks. ACM Conference on Electronic Commerce, vol. 4, (2003), p. 190 PDF
	S. Chawla, U. Rajan, R. Ravi and A. Sinha: Min-Max Payoffs of a Location Game. CMU CS Technical report CMU-CS-03-143, (2003), p. 190 PDF
	S. Chawla, D. Kitchin, U. Rajan, R. Ravi, and A. Sinha: Profit Maximizing Mechanisms for the Extended Multicasting Game. To appear in ACM-EC 2003; also CMU CS Technical Report CMU-CS-02-164, 2002 PDF
	S. Chawla, D. Kitchin, U. Rajan, R. Ravi, and A. Sinha: Profit Maximizing Mechanisms for the Extended Multicasting Game. To appear in ACM-EC 2003; also CMU CS Technical Report CMU-CS-02-164, 2002 PDF
	Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. S. Salman, Amitabh Sinha: : On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. IPCO 2001: 170-184 PDF / abs
	Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi: On the Approximability of the Minimum Test Collection Problem. ESA 2001: 158-169 PDF / abs
	Goran Konjevod, R. Ravi, F. S. Salman: On approximating planar metrics by tree metrics. Information Processing Letters 80(4): 213-219 (2001) PDF
	R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. Algorithmica 31(1): 58-78 (2001) PDF / abs
	P. Keskinocak, R. Ravi, S. Tayur: Scheduling and Reliable Lead Time Quotation for Orders with Availability Intervals and Lead Time Sensitive Revenues. Management Science, February 2001 PDF
	Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. TCS 235(1): 25-42 (2000) PDF
	Naveen Garg, Goran Konjevod, R. Ravi: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. J. Algorithms 37(1): 66-84 (2000) PDF
	Refael Hassin, R. Ravi, F. S. Salman: Approximation algorithms for a capacitated network design problem. APPROX 2000: 167-176 PDF
	Goran Konjevod, R. Ravi: An approximation algorithm for the covering Steiner problem. SODA 2000: 338-344 PDF / abs
	Jochen Könemann, R. Ravi: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. STOC 2000: 537-546 PDF / abs