Iterative Compression for Exactly Solving NP-Hard Minimization Problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6118220 (Why is no real title available?)
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 1467487 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A Cubic Kernel for Feedback Vertex Set
- Algorithms and experiments for parameterized approaches to hard graph problems
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
- An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
- Analogs & duals of the MAST problem for sequences & trees
- Approximating minimum feedback sets and multicuts in directed graphs
- Chordal Deletion Is Fixed-Parameter Tractable
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Correlation clustering
- Efficient exact algorithms through enumerating maximal independent sets and other techniques
- Experimental and Efficient Algorithms
- Faster Scaling Algorithms for Network Problems
- Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
- Finding odd cycle transversals.
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Fixed-Parameter Algorithms for Kemeny Scores
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
- Graph-modeled data clustering: Exact algorithms for clique generation
- Improved Algorithms for the Feedback Vertex Set Problems
- Iterative Compression and Exact Algorithms
- Maximal Flow Through a Network
- Multiway cuts in node weighted graphs
- ON DISJOINT CYCLES
- On the Hardness of Reoptimization
- Optimal Edge Deletions for Signed Graph Balancing
- Parameterized Complexity and Approximability of the SLCS Problem
- Parameterized and Exact Computation
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
Cited in
(18)- Parameterized complexity of vertex deletion into perfect graph classes
- Studies in Computational Aspects of Voting
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- FPT algorithms for path-transversal and cycle-transversal problems
- A fixed-parameter algorithm for the vertex cover P₃ problem
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- Fixed-parameter algorithms for cluster vertex deletion
- Measuring indifference: unit interval vertex deletion
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- Parameterized complexity of vertex deletion into perfect graph classes
- Confronting intractability via parameters
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Separator-based data reduction for signed graph balancing
- Iterative Compression and Exact Algorithms
- Bravely, moderately: a common theme in four recent works
- A complexity dichotomy for finding disjoint solutions of vertex deletion problems
- Fixed-parameter tractability results for feedback set problems in tournaments
- Iterative compression and exact algorithms
This page was built for publication: Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637312)
