Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicut is FPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A POLYNOMIAL KERNEL FOR MULTICUT IN TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating Multicut and Sparsest-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicut in trees viewed through the eyes of vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parameterized algorithm for the minimum node multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Cover and Graph Separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Limits to Classical and Quantum Instance Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach to multicut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms for path-transversal and cycle-transversal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and data reduction for multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for requirement cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Steiner and Directed Multicuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate max-Steiner-tree-packing min-Steiner-cut theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Important Separators and Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small separators in linear time via treewidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Sparsification and Oblivious Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for requirement cut on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and improved parameterized algorithms for multiterminal cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for feasible cut and multicut problems / rank
 
Normal rank

Latest revision as of 03:20, 12 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity dichotomy for \textsc{Steiner Multicut}
scientific article

    Statements

    Parameterized complexity dichotomy for \textsc{Steiner Multicut} (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2016
    0 references
    cut problems
    0 references
    Steiner multicut
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references