Preference-constrained oriented matching

DOI10.1137/1.9781611973006.9zbMath1430.05092OpenAlexW2404203836MaRDI QIDQ5194679

Lisa K. Fleischer, Zoya Svitkina

Publication date: 16 September 2019

Published in: 2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Efficient coordination mechanisms for unrelated machine scheduling ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ Decentralized utilitarian mechanisms for scheduling games

This page was built for publication: Preference-constrained oriented matching