On linear and semidefinite programming relaxations for hypergraph matching
From MaRDI portal
(Redirected from Publication:715088)
Recommendations
Cites work
- scientific article; zbMATH DE number 1003268 (Why is no real title available?)
- scientific article; zbMATH DE number 1305405 (Why is no real title available?)
- scientific article; zbMATH DE number 2079339 (Why is no real title available?)
- scientific article; zbMATH DE number 910871 (Why is no real title available?)
- scientific article; zbMATH DE number 2234850 (Why is no real title available?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- A factor 2 approximation algorithm for the generalized Steiner network problem
- An approximation algorithm for maximum triangle packing
- Approximating the independence number via the -function
- Approximation algorithms and hardness results for the clique packing problem
- CSP gaps and reductions in the lasserre hierarchy
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Critical hypergraphs and interesting set-pair systems
- Geometric algorithms and combinatorial optimization
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- Hall's theorem for hypergraphs
- Integrality gaps for Sherali-Adams relaxations
- Local global tradeoffs in metric embeddings
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Maximum degree and fractional matchings in uniform hypergraphs
- Non-approximability results for optimization problems on bounded degree instances
- On Completing Latin Squares
- On local search for weighted \(k\)-set packing
- On the Shannon capacity of a graph
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- On the complexity of approximating \(k\)-dimensional matching
- On the complexity of approximating \(k\)-set packing
- On the facial structure of set packing polyhedra
- On the fractional matching polytope of a hypergraph
- On two intersecting set systems and k-continuous Boolean functions
- Randomized graph products, chromatic numbers, and Lovasz j-function
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
- Ryser's conjecture for tripartite 3-graphs
- Santa Claus Meets Hypergraph Matchings
- Scheduling Split Intervals
- Sherali-Adams relaxations of the matching polytope
- The Lovász Number of Random Graphs
- The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
- The Santa Claus problem
- The ellipsoid method and its consequences in combinatorial optimization
- The sandwich theorem
- Tree-width and the Sherali-Adams operator
Cited in
(23)- Technical note -- Online hypergraph matching with delays
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
- Online crowdsourced truck delivery using historical information
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- Coverage, matching, and beyond: new results on budgeted mechanism design
- On the parameterized complexity of compact set packing
- Approximate multi-matroid intersection via iterative refinement
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
- An approximation result for matchings in partitioned hypergraphs
- scientific article; zbMATH DE number 6297805 (Why is no real title available?)
- On the matching polynomial of hypergraphs
- On the parameterized complexity of compact set packing
- On a representation of the matching polytope via semidefinite liftings
- Sherali-Adams relaxations of the matching polytope
- Distributed algorithms for matching in hypergraphs
- Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
- How to sell hyperedges: the hypermatching assignment problem
- Generalized hypergraph matching via iterated packing and local ratio
- Greedy matching: guarantees and limitations
- An axiomatic duality framework for the theta body and related convex corners
- Integrality gaps for colorful matchings
- Three algorithms for graph locally harmonious colouring
- ThIEF: finding genome-wide trajectories of epigenetics marks
This page was built for publication: On linear and semidefinite programming relaxations for hypergraph matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715088)
