Bi-criteria and approximation algorithms for restricted matchings (Q2453169): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989281842 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.5481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of maximum profit wavelength assignment in WDM rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Guarantees for Degree-Bounded Directed Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted matching and budgeted matroid intersection via the gasoline puzzle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelength Management in WDM Rings to Maximize the Number of Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelength Management in WDM Rings to Maximize the Number of Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The labeled maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197644 / 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: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling algorithms for network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Rounding for Multi-Objective Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Multi-Budgeted Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Algorithms for Matching and Matroid Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Matching Problems for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy in Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The labeled perfect matching in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized and Approximation Algorithms for Blue-Red Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of restricted spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in general graphs through randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Exact Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost exact matchings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:53, 8 July 2024

scientific article
Language Label Description Also known as
English
Bi-criteria and approximation algorithms for restricted matchings
scientific article

    Statements

    Bi-criteria and approximation algorithms for restricted matchings (English)
    0 references
    0 references
    0 references
    6 June 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    combinatorial optimization
    0 references
    linear programming
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references