Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249): 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.1007/3-540-56939-1_62 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1593787329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear-Time Algorithm for Graph Realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiway cut polyhedron / 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: Q3972951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / 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: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of the maximum common subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors, network decomposition, and multicommodity flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on the max-flow min-cut ratio for multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Whether a Given Binary Matroid is Graphic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank

Latest revision as of 23:40, 18 July 2024

scientific article; zbMATH DE number 7045103
Language Label Description Also known as
English
Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
scientific article; zbMATH DE number 7045103

    Statements

    Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2019
    0 references
    vertex cover
    0 references
    distance label
    0 references
    integral flow
    0 references
    multicommodity flow
    0 references
    edge capacity
    0 references

    Identifiers

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