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={Moshe Dror and James B. Orlin},
  journal={SIAM J. Discrete 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

References

Publications referenced by this paper.
SHOWING 1-10 OF 37 REFERENCES

Polynomial time approximation schemes for Euclidean TSP and other geometric problems

  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1990
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Generalized spanning trees

  • European Journal of Operational Research
  • 2000
VIEW 4 EXCERPTS

Hardness of approximations

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Computers and Intractability: A Guide to the Theory of NP-Completeness

Michael Randolph Garey, David S. Johnson
  • 1978
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Some NP-Complete Geometric Problems

Michael Randolph Garey, Ronald L. Graham, David S. Johnson
  • STOC
  • 1976
VIEW 19 EXCERPTS
HIGHLY INFLUENTIAL