A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties

  title={A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties},
  author={Toshihiro Fujito},
This paper is concerned with the polynomial time approximability of node-deletion problems for hereditary properties. We will focus on such graph properties that are derived from matroids definable on the edge set of any graph. It will be shown first that all the node-deletion problem for such properties can be uniformly formulated by a simple but non-standard form of the integer program. A primaldual approximation algorithm based on this and the dual of its linear relaxation is then presented. 
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property
This work presents the first (linear time) 2-approximation algorithm for the edge clique complement problem, and uses the local-ratio technique to develop 2- approximation algorithms for the first two variants of the problem.
Approximating minimum feedback vertex sets in hypergraphs
Wavelength Conversion in Shortest-Path All-Optical Networks
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their capacity usage. We


A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract)
This paper considers a unified approximation method for node-deletion problems with nontrivial and hereditary graph properties through a few generic approximation preserving reductions from the Vertex Cover problem.
The Approximation of Maximum Subgraph Problems
It is shown that the problem to find the maximum number of nodes inducing a subgraph that satisfies a desired property π on directed or undirected graphs that is nontrivial and hereditary on induced subgraphs is hard to approximate.
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs
It is shown that a generalized local ratio strategy leads to an efficient approximation with the performance guarantee of twice the optimal, improving the previous results for both weighted and unweighted cases.
Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference
It is shown how polynomial-time algorithms provided for approximating the problem of finding a vertex feedback set of G with a smallest weight can improve the search performance for constraint satisfaction problems and in the area of Bayesian inference of graphs with blackout vertices.
Some optimal inapproximability results
  • J. Håstad
  • Computer Science, Mathematics
    STOC '97
  • 1997
We prove optimal, up to an arbitrary 2 > 0, inapproximability results for Max-Ek-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations
Matroidal families of finite connected nonhomeomorphic graphs exist
The question whether there are any matroidal families besides the four previously described by Simoes-Pereira is answered affirmatively and it is shown that for every natural number n ⩾ 2 there is aMatroidal family that contains the complete graph with n vertices.