A Unified Approximation Algorithm for Node-deletion Problems

@article{Fujito1998AUA,
  title={A Unified Approximation Algorithm for Node-deletion Problems},
  author={Toshihiro Fujito},
  journal={Discrete Applied Mathematics},
  year={1998},
  volume={86},
  pages={213-231}
}
In this paper we consider a unified (polynomial time) approximation method for node-deletion problems with nontrivial and hereditary graph properties. One generic algorithm scheme is presented, which can be applied to any node-deletion problem for finding approximate solutions. It will be shown then that the quality of solutions found by this algorithm is determined by the quality of any minimal solution in any graph in which nodes are weighted according to a certain scheme chosen by the… CONTINUE READING

From This Paper

Topics from this paper.
29 Citations
16 References
Similar Papers

Citations

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

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…