Primal-dual RNC approximation algorithms for set cover and covering integer programs

SIAM Journal on Computing

Volumn 28, Issue 2, 1998, Pages 525-540

  Rajagopalan, Sridhar ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PARALLEL ALGORITHMS; RANDOM PROCESSES;

PRIMAL-DUAL SCHEMA; SET COVER ALGORITHMS;

INTEGER PROGRAMMING;

EID: 0032107972     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793260763     Document Type: Article

References (2)

1. [BRS89] B. BERGER, J. ROMPEL, AND P. SHOR, Efficient NC algorithms for set cover with applications to learning and geometry, in Proc. 30th IEEE Symposium on the Foundations of Computer Science, 1989, pp. 54-59.
2. [Ch79] V. CHVATAL, A greedy heuristic for the set covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.