Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032692205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with Partial Information / 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: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results / 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: Q3549698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parameterized Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering in general weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / 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: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / 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: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal Deletion Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Multiterminal Cuts / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:17, 3 July 2024

scientific article
Language Label Description Also known as
English
Constant ratio fixed-parameter approximation of the edge multicut problem
scientific article

    Statements

    Constant ratio fixed-parameter approximation of the edge multicut problem (English)
    0 references
    0 references
    0 references
    1 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed-parameter algorithms
    0 references
    parameterized approximation
    0 references
    multicut
    0 references
    satisfiability problems
    0 references
    graph algorithms
    0 references
    Edge Multicut Problem
    0 references
    0 references