Howard J. Karloff

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 Lee Breslau

> Home > Persons > Howard J. Karloff

Publications

2020
[j49]
- view
  authority control:
- export record
  dblp key:
  - journals/ior/JohnsonBDDGHKRS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ior/JohnsonBDDGHKRS20
David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. Oper. Res. 68(3): 896-926 (2020)
2016
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/JohnsonBDD0HKRS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/JohnsonBDD0HKRS16
David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. CoRR abs/1611.01210 (2016)
2011
[c40]
- view
  authority control:
- export record
  dblp key:
  - conf/alenex/BreslauDDGHJKRS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alenex/BreslauDDGHJKRS11
Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Disjoint-Path Facility Location: Theory and Practice. ALENEX 2011: 60-74

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.