A polyhedral approach to the feedback vertex set problem
From MaRDI portal
Publication:4645941
DOI10.1007/3-540-61310-2_33zbMATH Open1415.90063OpenAlexW1581643485MaRDI QIDQ4645941FDOQ4645941
Authors: Meinrad Funke, Gerhard Reinelt 
Publication date: 11 January 2019
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61310-2_33
Recommendations
- Parameterized and Exact Computation
- Solving the feedback vertex set problem on undirected graphs
- On the feedback vertex set problem for a planar graph
- Improved algorithms for feedback vertex set problems
- Improved Algorithms for the Feedback Vertex Set Problems
- FPT algorithms for generalized feedback vertex set problems
- Simultaneous feedback vertex set: a parameterized perspective
- Simultaneous feedback vertex set: a parameterized perspective
- Fixed parameterized algorithms for generalized feedback vertex set problems
- scientific article; zbMATH DE number 1029225
Cites Work
- Reducibility among combinatorial problems
- Weakly bipartite graphs and the max-cut problem
- Title not available (Why is that?)
- On the acyclic subgraph polytope
- Introduction to ABACUS -- a branch-and-cut system
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the feedback vertex set problem for a planar graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- General topological results on the construction of a minimum essential set of a directed graph
- Robust linear algorithms for cutsets
Cited In (17)
- Title not available (Why is that?)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
- A constraint programming approach to cutset problems
- Algorithms for finding maximum transitive subtournaments
- On the feedback vertex set polytope of a series-parallel graph
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- Solving the feedback vertex set problem on undirected graphs
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Introduction to ABACUS -- a branch-and-cut system
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Almost always observable hybrid systems
- Improved Algorithms for the Feedback Vertex Set Problems
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- Two Hardness Results on Feedback Vertex Sets
Uses Software
This page was built for publication: A polyhedral approach to the feedback vertex set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645941)
