Approximating minimum feedback vertex sets in hypergraphs

DOI10.1016/S0304-3975(99)00043-2zbMath0959.68100WikidataQ126556784 ScholiaQ126556784MaRDI QIDQ1583598

Toshihiro Fujito

Publication date: 31 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

hypergraphsfeedback vertex set problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

On the feedback number of 3-uniform linear extremal hypergraphs ⋮ New upper bounds on feedback vertex numbers in butterflies

Cites Work

• Ramsey numbers and an approximation algorithm for the vertex cover problem
• The node-deletion problem for hereditary properties is NP-complete
• Optimization, approximation, and complexity classes
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• A primal-dual approach to approximation of node-deletion problems for matroidal properties
• The approximation of maximum subgraph problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating minimum feedback vertex sets in hypergraphs