Optimal matroid partitioning problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6474898 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- 3-partitioning problems for maximizing the minimum load
- A tight bound for 3-partitioning
- A weighted matroid intersection algorithm
- Analytical approach to parallel repetition
- Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint
- Approximation algorithms for scheduling unrelated parallel machines
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms.
- Constrained partitioning problems
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint
- Matroid matching and some applications
- Matroid matching: the power of local search
- Minimum partition of a matroid into independent subsets
- On the configuration-LP for scheduling on unrelated machines
- On uniform \(k\)-partition problems
- Optimal matroid partitioning problems
- The \(k\)-partitioning problem
- The dense \(k\)-subgraph problem
- Transversals and matroid partition
- \(\kappa\)-partitioning problems for maximizing the minimum load
- \(k\)-partitioning problems with partition matroid constraint
Cited in
(6)
This page was built for publication: Optimal matroid partitioning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032344)
