Simultaneous matchings: Hardness and approximation (Q931730): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the system of two all different\(\_\)predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation properties of the Independent set problem for degree 3 graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4389326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473034 / 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

Latest revision as of 12:45, 28 June 2024

scientific article
Language Label Description Also known as
English
Simultaneous matchings: Hardness and approximation
scientific article

    Statements

    Simultaneous matchings: Hardness and approximation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    matchings
    0 references
    perfect matchings
    0 references
    constraint programming
    0 references
    NP-completeness
    0 references
    optimisation
    0 references
    hardness of approximation
    0 references
    bipartite graph
    0 references
    0 references