Approximating minimum feedback vertex sets in hypergraphs
From MaRDI portal
Publication:1583598
DOI10.1016/S0304-3975(99)00043-2zbMATH Open0959.68100WikidataQ126556784 ScholiaQ126556784MaRDI QIDQ1583598FDOQ1583598
Authors: Toshihiro Fujito 
Publication date: 31 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- On locating minimum feedback vertex sets
- Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
- Approximating minimum feedback sets and multicuts in directed graphs
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- scientific article; zbMATH DE number 1029225
- scientific article; zbMATH DE number 1342121
- Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
- Feedback vertex set on graphs of low cliquewidth
- Approximating minimum feedback sets and multi-cuts in directed graphs (extended summary)
- Enumerating minimal subset feedback vertex sets
Cites Work
- Title not available (Why is that?)
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- Approximation algorithms for NP-hard problems.
- The node-deletion problem for hereditary properties is NP-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The approximation of maximum subgraph problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- A primal-dual approach to approximation of node-deletion problems for matroidal properties
Cited In (10)
- Exact algorithms for finding minimum transversals in rank-3 hypergraphs
- Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
- New upper bounds on feedback vertex numbers in butterflies
- Title not available (Why is that?)
- On the feedback number of 3-uniform linear extremal hypergraphs
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
- Approximating minimum feedback sets and multicuts in directed graphs
- Algorithms and Computation
- On the feedback number of 3-uniform hypergraphs
- Two Hardness Results on Feedback Vertex Sets
This page was built for publication: Approximating minimum feedback vertex sets in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583598)
