Pages that link to "Item:Q715088"

The following pages link to On linear and semidefinite programming relaxations for hypergraph matching (Q715088):

Displaying 19 items.

• Greedy matching: guarantees and limitations (Q513303) (← links)
• An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
• Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
• Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
• Online crowdsourced truck delivery using historical information (Q2140193) (← links)
• Integrality gaps for colorful matchings (Q2419586) (← links)
• A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)
• On a representation of the matching polytope via semidefinite liftings (Q2757579) (← links)
• An Approximation Result for Matchings in Partitioned Hypergraphs (Q2806888) (← links)
• Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design (Q2959848) (← links)
• Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
• Three algorithms for graph locally harmonious colouring (Q4978237) (← links)
• Technical Note—Online Hypergraph Matching with Delays (Q5106363) (← links)
• ThIEF: Finding Genome-wide Trajectories of Epigenetics Marks (Q5111825) (← links)
• (Q5241134) (← links)
• (Q5417726) (← links)
• Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
• Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture (Q6077050) (← links)
• On the parameterized complexity of compact set packing (Q6623598) (← links)