|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 10 keywords
|
|
|
|
|
Results
Found 26 publication records. Showing 26 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | André Berger, Ojas Parekh |
Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Ojas Parekh, Danny Segev |
A Unified Approach to Approximating Partial Covering Problems. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley |
Approximation Algorithms for k-hurdle Problems. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ojas Parekh |
Iterative Packing for Demand and Hypergraph Matching. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | James J. Lu, Sebastien Siva, Ojas Parekh, George H. L. Fletcher, Hantao Zhang |
Constraint processing in relational database systems: from theory to implementation. |
SAC |
2010 |
DBLP DOI BibTeX RDF |
CSP tools, KR languages, relational databases |
| 1 | Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh |
Compacting cuts: A new linear formulation for minimum cut. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Linear programming formulation complexity, minimum cut problem |
| 1 | Ojas Parekh |
Approximation algorithms for partially covering with edges. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ojas Parekh, Danny Segev |
Path Hitting in Acyclic Graphs. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Edge cover, Tree augmentation, Tree multicut, Approximation algorithms, Linear programming, Primal-dual, Edge dominating set |
| 1 | André Berger, Ojas Parekh |
Linear Time Algorithms for Generalized Edge Dominating Set Problems. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Trees, Edge dominating set |
| 1 | Jochen Könemann, Ojas Parekh, David Pritchard |
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh |
Approximability of the capacitated b-edge dominating set problem. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh |
Compacting cuts: a new linear formulation for minimum cut. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert D. Carr, Ojas Parekh |
A 1/2-integral relaxation for the A-matching problem. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ojas Parekh, Danny Segev |
Path Hitting in Acyclic Graphs. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Ojas Parekh, Danny Segev |
A Unified Approach to Approximating Partial Covering Problems. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | André Berger, Ojas Parekh |
Linear Time Algorithms for Generalized Edge Dominating Set Problems. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo |
Finding effective support-tree preconditioners. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
combinatorial preconditioner, linear systems, iterative solver |
| 1 | Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha |
An approximation algorithm for the edge-dilation k-center problem, . |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha |
Improved Approximations for Tour and Tree Covers. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Graph algorithms, Network design |
| 1 | Ojas Parekh |
Forestation in Hypergraphs: Linear k-Trees. |
Electr. J. Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Ojas Parekh, R. Ravi |
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ojas Parekh |
Edge dominating and hypomatchable sets. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha |
Approximation Algorithms for Edge-Dilation k-Center Problems. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh |
A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. |
J. Comb. Optim. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh |
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha |
Improved approximations for tour and tree covers. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #26 of 26 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")