Partial multicuts in trees (Q861281): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138694041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Homogeneous Weights for Approximating the Partial Cover 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: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for partial covering problems / 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: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the <i>k</i>-multicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / 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: A Unified Approach to Approximating Partial Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial-time approximation for a class of bicriteria problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved performance of the greedy algorithm for partial cover / rank
 
Normal rank

Latest revision as of 12:25, 25 June 2024

scientific article
Language Label Description Also known as
English
Partial multicuts in trees
scientific article

    Statements

    Partial multicuts in trees (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    multicut
    0 references
    Lagrangian relaxation
    0 references
    approximation algorithms
    0 references

    Identifiers