The following pages link to Ojas Parekh (Q222490):
Displaying 35 items.
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- An approximation algorithm for the edge-dilation \(k\)-center problem. (Q703267) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Forestation in hypergraphs: Linear \(k\)-trees (Q1408553) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Improved approximations for tour and tree covers (Q1879245) (← links)
- On small-depth tree augmentations (Q2102832) (← links)
- Erratum to: ``Linear time algorithms for generalized edge dominating set problems'' (Q2428651) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- On factor width and symmetric \(H\)-matrices (Q2484241) (← links)
- (Q2753739) (← links)
- (Q2753930) (← links)
- Compacting cuts (Q2930250) (← links)
- (Q2934581) (← links)
- The Approximability of Partial Vertex Covers in Trees (Q2971146) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- (Q3046493) (← links)
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs (Q3190147) (← links)
- (Q4411398) (← links)
- (Q4828945) (← links)
- Computing with Spikes: The Advantage of Fine-Grained Timing (Q5157248) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- A Combinatorial Model for Dentate Gyrus Sparse Coding (Q5380636) (← links)
- Algorithms and Data Structures (Q5394253) (← links)
- A Unified Approach to Approximating Partial Covering Problems (Q5449551) (← links)
- Path Hitting in Acyclic Graphs (Q5449559) (← links)
- (Q5875485) (← links)
- A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem (Q5952320) (← links)
- (Q6058189) (← links)
- Synergies Between Operations Research and Quantum Information Science (Q6203362) (← links)
- Probing a set of trajectories to maximize captured information (Q6487600) (← links)