Work

Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs

Year: 2014

Type: preprint

Abstract: We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing/covering linear programs, and for (non-metric) fractional facility location. We also describe the first parallel algorithms requiring only near-linear total work and finishing in polylog time. The algorithms compute $(1+ε)$-approximate solutions in time (and work) $O^*(N/ε^2)$, where $N$ is the number of non-zeros in the constraint matrix. For facility location, $N$ is the number of eligible client/facility pairs.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1407.3015

Author: Young, Neal E.

Institution: University of California, Riverside

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Award: AF: Small: Nearly Linear-Time Algorithms for Mixed Packing and Covering Linear Programs

OpenAlex ID: W1765616704

Cites: 24

Cited by: 5

Related to: 20