Matchings under distance constraints. II.
From MaRDI portal
Publication:6596960
DOI10.1007/s10479-023-05703-wMaRDI QIDQ6596960
Publication date: 3 September 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
schedulingapproximation algorithmsintegrality gapconstrained matchingoptimal permutationdistance matchingrestricted b-matching
Cites Work
- Unnamed Item
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures
- Complexity of packing common bases in matroids
- The distance matching problem
- Matchings under distance constraints. I
- On some hard and some tractable cases of the maximum acyclic matching problem
- Polyhedral results for position-based scheduling of chains on a single machine
- Approximating maximum uniquely restricted matchings in bipartite graphs
- Complexity of approximating bounded variants of optimization problems
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- Restricted b-Matchings in Degree-Bounded Graphs
- Some Matching Problems for Bipartite Graphs
- Reducibility among Combinatorial Problems
- Models and solution techniques for frequency assignment problems
This page was built for publication: Matchings under distance constraints. II.
