C. Greg Plaxton

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 Madhukar R. Korupolu

> Home > Persons > C. Greg Plaxton

Publications

2001
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/jal/KorupoluPR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/KorupoluPR01
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Placement Algorithms for Hierarchical Cooperative Caching. J. Algorithms 38(1): 260-302 (2001)
2000
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/jal/KorupoluPR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/KorupoluPR00
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Analysis of a Local Search Heuristic for Facility Location Problems. J. Algorithms 37(1): 146-188 (2000)
1999
[c28]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/KorupoluPR99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/KorupoluPR99
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Placement Algorithms for Hierarchical Cooperative Caching. SODA 1999: 586-595
1998
[c27]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/KorupoluPR98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/KorupoluPR98
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Analysis of a Local Search Heuristic for Facility Location Problems. SODA 1998: 1-10

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.