Iterative Compression for Exactly Solving NP-Hard Minimization Problems
type: Item
instance of: scholarly article
title: Iterative Compression for Exactly Solving NP-Hard Minimization Problems
zbMATH Open document ID: 1248.68380
DOI: 10.1007/978-3-642-02094-0_4
author: Jiong Guo
author: Hannes Moser
author: Rolf Niedermeier
published in: Algorithmics of Large and Complex Networks
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5577003
MaRDI profile type: Publication
full work available at URL: 978-3-642-02094-0 4
OpenAlex ID: W2134628243
cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
cites work: Correlation clustering
cites work: Q4488089
cites work: Fixed-Parameter Algorithms for Kemeny Scores
cites work: On the Hardness of Reoptimization
cites work: ON DISJOINT CYCLES
cites work: A Cubic Kernel for Feedback Vertex Set
cites work: Improved Algorithms for the Feedback Vertex Set Problems
cites work: An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
cites work: Q3549698
cites work: An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
cites work: Parameterized and Exact Computation
cites work: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
cites work: Q4027320
cites work: Approximating minimum feedback sets and multicuts in directed graphs
cites work: Analogs & duals of the MAST problem for sequences & trees
cites work: Q3145802
cites work: Iterative Compression and Exact Algorithms
cites work: Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
cites work: Maximal Flow Through a Network
cites work: Faster Scaling Algorithms for Network Problems
cites work: Multiway cuts in node weighted graphs
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: Parameterized Complexity and Approximability of the SLCS Problem
cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
cites work: Experimental and Efficient Algorithms
cites work: Q3600916
cites work: Optimal Edge Deletions for Signed Graph Balancing
cites work: Fixed-Parameter Algorithms for Cluster Vertex Deletion
cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut
cites work: Chordal Deletion Is Fixed-Parameter Tractable
cites work: The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
cites work: Q5710169
cites work: Efficient exact algorithms through enumerating maximal independent sets and other techniques
cites work: Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
cites work: Finding odd cycle transversals.
description: scientific article