An approximation algorithm for the generalized \(k\)-multicut problem (Q423940): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peng Zhang / rank
Normal rank
 
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.dam.2012.01.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088728264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the multicut problem in bounded tree-width graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm of MULTIWAY CUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiway cut polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cut and integer flow problems in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / 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: A General Approximation Technique for Constrained Forest Problems / 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: Dial a Ride from k-Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding algorithms for a geometric embedding of minimum multiway cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Generalized Multicut on Trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:29, 5 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for the generalized \(k\)-multicut problem
scientific article

    Statements

    An approximation algorithm for the generalized \(k\)-multicut problem (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    \(k\)-multicut
    0 references
    \(k\)-forest
    0 references
    LP-rounding
    0 references
    approximation algorithm
    0 references
    combinatorial optimization
    0 references

    Identifiers