Parekh Ojas

Ojas Parekh

Information about the author Ojas Parekh will soon be added to the site.
Found 6 papers in total
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Linear Time Algorithms for Generalized Edge Dominating Set Problems
2008
We prove that a generalization of the edge dominating set problem, in which each edge...
A Unified Approach to Approximating Partial Covering Problems
A Unified Approach to Approximating Partial Covering Problems
2011
An instance of the generalized partial cover problem consists of a ground set U and a...
Approximation Algorithms for k‐hurdle Problems
Approximation Algorithms for k‐hurdle Problems
2011
The polynomial‐time solvable k ‐hurdle problem is a natural...
A ½-integral relaxtion for the A-matching problem
A ½-integral relaxtion for the A-matching problem
2006
The A -matching problem generalizes matching problems by stipulating that the degree...
Improved approximations for tour and tree covers
Improved approximations for tour and tree covers
2003
A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree...
An approximation algorithm for the edge-dilation k-center problem
An approximation algorithm for the edge-dilation k-center problem
2004
We provide an approximation algorithm for selecting centers in a complete graph so as...
Papers per page: