Degree-Constrained Subgraph Problems: Hardness and Approximation Results

@inproceedings{Amini2008DegreeConstrainedSP,
  title={Degree-Constrained Subgraph Problems: Hardness and Approximation Results},
  author={Omid Amini and David Peleg and St{\'e}phane P{\'e}rennes and Ignasi Sau and Saket Saurabh},
  booktitle={WAOA},
  year={2008}
}
A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph G and the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This paper considers two natural Degree-Constrained Subgraph problems and studies their behavior in terms of approximation algorithms. These problems take as input an undirected graph G = (V, E), with |V | = n and |E| = m. Our results, together with the… CONTINUE READING
13 Citations
22 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

  • O. Amini, D. Peleg, S. Pérennes, I. Sau, S. Saurabh
  • Technical Report 6690, INRIA,
  • 2008
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…