Ojas Parekh

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jochen Könemann

> Home > Persons > Ojas Parekh

Publications

2014
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KonemannPP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KonemannPP14
Jochen Könemann, Ojas Parekh, David Pritchard:
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation. Algorithmica 68(3): 776-804 (2014)
2011
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KonemannPS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KonemannPS11
Jochen Könemann, Ojas Parekh, Danny Segev:
A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011)
2008
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/waoa/KonemannPP08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waoa/KonemannPP08
Jochen Könemann, Ojas Parekh, David Pritchard:
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA 2008: 1-14
2006
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/esa/KonemannPS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/KonemannPS06
Jochen Könemann, Ojas Parekh, Danny Segev:
A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479
2004
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KonemannKPS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KonemannKPS03
Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha:
Improved Approximations for Tour and Tree Covers. Algorithmica 38(3): 441-449 (2004)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/orl/KonemannLPS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/KonemannLPS04
Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha:
An approximation algorithm for the edge-dilation k-center problem^,. Oper. Res. Lett. 32(5): 491-495 (2004)
2002
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/swat/KonemannLPS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/KonemannLPS02
Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha:
Approximation Algorithms for Edge-Dilation k-Center Problems. SWAT 2002: 210-219
2000
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/KonemannKPS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/KonemannKPS00
Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha:
Improved approximations for tour and tree covers. APPROX 2000: 184-193

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.