Integrality gaps for colorful matchings (Q2419586): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2911187972 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1801.07937 / 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: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost exact matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching of given weight in complete and complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in colored bipartite networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Bounded Color Matchings via Convex Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Packing for Demand and Hypergraph Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Hypergraph Matching via Iterated Packing and Local Ratio / 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: 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: Cones of Matrices and Set-Functions and 0–1 Optimization / 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: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Algebra Lift Operators for 0-1 Integer Programming / 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: Q3002764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sherali-adams relaxations of the matching polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear and semidefinite programming relaxations for hypergraph matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-Project Methods for Set Cover and Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Guarantees through Higher Levels of SDP Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation guarantee for chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxMin allocation via degree lower-bounded arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Sparsest Cut in Graphs of Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsest cut on bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum degree and fractional matchings in uniform hypergraphs / 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: Wavelength Management in WDM Rings to Maximize the Number of Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Matching Problems for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight edge-constrained matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum transversal in partial Latin squares and rainbow matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for rainbow matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy in Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-criteria and approximation algorithms for restricted matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Representation of the Matching Polytope Via Semidefinite Liftings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift and project relaxations for the matching and related polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in Latin Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4389332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods in Combinatorial Optimization / rank
 
Normal rank

Latest revision as of 13:30, 19 July 2024

scientific article
Language Label Description Also known as
English
Integrality gaps for colorful matchings
scientific article

    Statements

    Integrality gaps for colorful matchings (English)
    0 references
    0 references
    0 references
    14 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    linear programming
    0 references
    lift and project
    0 references
    Sherali-Adams
    0 references
    colorful matchings
    0 references
    integrality gap
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references