Searching for authors named "Ojas Parekh" – sorted by Relevance.
-
Forestation in Hypergraphs: Linear k-trees
- Forestation in hypergraphs: linear k-trees Ojas Parekh Department of Mathematics and Computer
- Cited by 1 (0 self) – Add To MetaCart
-
Linear time algorithms for generalized edge dominating set problems
- Linear Time Algorithms for Generalized Edge Dominating Set Problems André Berger 1 and Ojas Parekh
- Cited by 1 (0 self) – Add To MetaCart
-
Randomized approximation algorithms for query optimization problems on two processors
- Laber1 ⋆ , Ojas Parekh2 3 ⋆⋆ , and R. Ravi 1 Puc-Rio, Rio de Janeiro, Brasil, laber@(email omitted); 2
- Cited by 3 (1 self) – Add To MetaCart
-
Path hitting in acyclic graphs
- Path Hitting in Acyclic Graphs ⋆ Ojas Parekh 1 and Danny Segev 2 1 Department of Mathematics
- Cited by 3 (1 self) – Add To MetaCart
-
unknown title
- Parekh, and Amitabh Sinha Carnegie Mellon University, Pittsburgh, PA 15213-3890, USA. fjochen
- Add To MetaCart
-
Improved Approximations for Tour and Tree Covers
- ?? , Ojas Parekh 2? ? ? , and Amitabh Sinha 1y 1 Graduate School of Industrial Administration, Carnegie
- Cited by 4 (0 self) – Add To MetaCart
-
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
- Problem Robert Carr 1? , Toshihiro Fujito 2?? , Goran Konjevod 3? ? ? , and Ojas Parekh 3y 1
- Cited by 8 (3 self) – Add To MetaCart
-
A unified approach to approximating partial covering problems
- A Unified Approach to Approximating Partial Covering Problems Jochen Könemann 1⋆ , Ojas Parekh 2
- Cited by 4 (1 self) – Add To MetaCart
-
A Survey and New Results in Renegotiated Service
- A Survey and New Results in Renegotiated Service Ellen W. Zegura Scott McFarland Ojas Parekh
- Cited by 1 (0 self) – Add To MetaCart
-
Solving symmetric diagonally-dominant systems by preconditioning. Unpublished manuscript
- Ojas Parekh R. Ravi Shan Leung Maverick Woo Computer Science Department, Carnegie Mellon University
- Cited by 5 (0 self) – Add To MetaCart

