How to Sell Hyperedges: The Hypermatching Assignment Problem

DOI10.1137/1.9781611973105.25zbMath1425.90053OpenAlexW4232911618MaRDI QIDQ5741733

Monaldo Mastrolilli, Fabrizio Grandoni, Marek Cygan

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.25

Mathematics Subject Classification ID

Hypergraphs (05C65) Management decision making, including multiple objectives (90B50) Production models (90B30) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (15)

$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm ⋮ On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy ⋮ Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials ⋮ The limits of local search for weighted \(k\)-set packing ⋮ An improved kernel for planar vertex-disjoint triangle packing ⋮ Perfect matching in bipartite hypergraphs subject to a demand graph ⋮ Coupled and \(k\)-sided placements: generalizing generalized assignment ⋮ On maximum bipartite matching with separation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The limits of local search for weighted \(k\)-set packing ⋮ Approximate multi-matroid intersection via iterative refinement ⋮ Unnamed Item ⋮ An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint

This page was built for publication: How to Sell Hyperedges: The Hypermatching Assignment Problem