Cooperation in Multiorganization Matching

DOI10.1007/978-3-540-93980-1_7zbMath1209.91117OpenAlexW2158454894MaRDI QIDQ3602831

Laurent Gourvès, Jérôme Monnot, Fanny Pascual

Publication date: 12 February 2009

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_7

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Matching models (91B68)

Related Items (1)

Network sharing by two mobile operators: beyond competition, cooperation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assignment problems: a golden anniversary survey
• Exact arborescences, matchings and cycles
• Matching is as easy as matrix inversion
• The assignment game. I: The core
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of restricted spanning tree problems
• Maximum matching of given weight in complete and complete bipartite graphs
• Cooperation in Multi-organization Scheduling

This page was built for publication: Cooperation in Multiorganization Matching