Matchings under distance constraints. II.
From MaRDI portal
Recommendations
Cites work
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Approximating maximum uniquely restricted matchings in bipartite graphs
- Complexity of approximating bounded variants of optimization problems
- Complexity of packing common bases in matroids
- Connections in combinatorial optimization
- List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures
- Matchings under distance constraints. I
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Models and solution techniques for frequency assignment problems
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- 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
- Reducibility among combinatorial problems
- Restricted b-matchings in degree-bounded graphs
- Some Matching Problems for Bipartite Graphs
- The distance matching problem
This page was built for publication: Matchings under distance constraints. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596960)
