A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem
From MaRDI portal
Publication:1380926
DOI10.1007/BF01581725zbMath0897.90189MaRDI QIDQ1380926
Arie Tamir, Joseph S. B. Mitchell
Publication date: 11 March 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Cooperative games (91A12) Discrete location and assignment (90B80)
Related Items (5)
Hierarchical \(b\)-matching ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Efficient Approximation Algorithms for Weighted $b$-Matching ⋮ Erratum to: ``Two dimensional maximum weight matching using Manhattan topology ⋮ A note on balancedness of dominating set games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial algorithm for b-matchings: An alternative approach
- Some properties of a centroid of a free tree
- Zero measure spectrum for the almost Mathieu operator
- On geometric graphs with no two edges in convex position
- Stable matching with preferences derived from a psychological model
- The centrality index of a graph
- Geometry Helps in Matching
- A Note on the Room-Mates Problem and a Related Revenue Allocation Problem
- Linear Systems for Constrained Matching Problems
- Visibility graphs and obstacle-avoiding shortest paths
- Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Fast Matching Algorithms for Points on a Polygon
- On the core of linear production games
- A new characterization of tree medians with applications to distributed sorting
- Matrix searching with the shortest path metric
- College Admissions and the Stability of Marriage
This page was built for publication: A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem
