Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets

@article{Dror2008CombinatorialOW,
title={Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets},
author={M. Dror and J. Orlin},
journal={SIAM J. Discret. Math.},
year={2008},
volume={21},
pages={1019-1034}
}

We examine a selective list of combinatorial optimization problems in NP with respect to inapproximability (Arora and Lund (1997)) given that the ground set of elements $N$ has additional characteristics. For each problem in this paper, the set $N$ is expressed explicitly by subsets of $N$ either as a partition or in the form of a cover. The problems examined are generalizations of well-known classical graph problems and include the minimal spanning tree problem, a number of elementary machine… CONTINUE READING