ScholarLens Back to search
2020•Operations ResearchRequires access

Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs

David Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard Karloff, Maurício G. C. Resende, Subhabrata Sen

Open publisher page 17 citations

Abstract

Content Distribution and End-to-End Monitoring with Set Cover by Pairs

About this research paper

What this paper is about

Content Distribution and End-to-End Monitoring with Set Cover by Pairs

Why it matters

OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Content Distribution and End-to-End Monitoring with Set Cover by Pairs

Key concepts: Cover (algebra), Path (computing), Disjoint sets, Set cover problem, Facility location problem, Set (abstract data type), Computer science, Distribution (mathematics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs — Research Paper | ScholarLens