Matchings under distance constraints. I
From MaRDI portal
Publication:2241576
DOI10.1007/s10479-021-04127-8OpenAlexW3177317318MaRDI QIDQ2241576
Publication date: 9 November 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-021-04127-8
schedulingapproximation algorithmsparameterized algorithmsintegrality gapconstrained matchingdistance matchingrestricted \(b\)-matching
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures
- A strongly polynomial minimum cost circulation algorithm
- The distance matching problem
- On some hard and some tractable cases of the maximum acyclic matching problem
- Approximating maximum uniquely restricted matchings in bipartite graphs
- 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