Odd Multiway Cut in Directed Acyclic Graphs (Q3300762): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An improved integrality gap for the Călinescu-Karloff-Rabani relaxation for multiway cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity dichotomy for \textsc{Steiner Multicut} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing non-zero \(A\)-paths in group-labelled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear kernels and linear-time algorithms for finding large cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIN-MAX theorems for packing and covering odd \((u,v)\)-trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time FPT Algorithms via Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability for subset feedback set problems with parity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick but odd growth of cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression via Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The even-path problem for graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting Selected (Odd) Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Parameterized Algorithms Using Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Tractability of Multiway Cut with Parity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity and Approximability of Directed Odd Cycle Transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / 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: Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing odd paths / rank
 
Normal rank

Revision as of 04:06, 23 July 2024

scientific article
Language Label Description Also known as
English
Odd Multiway Cut in Directed Acyclic Graphs
scientific article

    Statements

    Odd Multiway Cut in Directed Acyclic Graphs (English)
    0 references
    0 references
    0 references
    30 July 2020
    0 references
    odd multiway cut
    0 references
    fixed-parameter tractability
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references