Satish Rao

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 Chris Harrelson

> Home > Persons > Satish Rao

Publications

2007
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/FakcharoenpholHR07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/FakcharoenpholHR07
Jittat Fakcharoenphol, Chris Harrelson, Satish Rao:
The k-traveling repairmen problem. ACM Trans. Algorithms 3(4): 40 (2007)
2005
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/recomb/BachrachCHMRS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/BachrachCHMRS05
Abraham Bachrach, Kevin C. Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah:
Lower Bounds for Maximum Parsimony with Gene Order Data. Comparative Genomics 2005: 1-10
2003
[c45]
- view
  - electronic edition @ acm.org
  - details & citations
- export record
  dblp key:
  - conf/soda/FakcharoenpholHRT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/FakcharoenpholHRT03
Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar:
An improved approximation algorithm for the 0-extension problem. SODA 2003: 257-265
[c44]
- view
  - electronic edition @ acm.org
  - details & citations
- export record
  dblp key:
  - conf/soda/FakcharoenpholHR03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/FakcharoenpholHR03
Jittat Fakcharoenphol, Chris Harrelson, Satish Rao:
The k-traveling repairman problem. SODA 2003: 655-664
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/spaa/HarrelsonHR03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/HarrelsonHR03
Chris Harrelson, Kirsten Hildrum, Satish Rao:
A polynomial-time tree decomposition to minimize congestion. SPAA 2003: 34-43

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.