k-partitioning problems with partition matroid constraint
From MaRDI portal
Recommendations
- Approximation algorithms for k-partitioning problems with partition matroid constraint
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint
- 3-partitioning problems for maximizing the minimum load
- Min-Max partitioning problem with matroid constraint
- \(\kappa\)-partitioning problems for maximizing the minimum load
Cites work
- 3-partitioning problems for maximizing the minimum load
- \(\kappa\)-partitioning problems for maximizing the minimum load
- A tight bound for 3-partitioning
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
- Bounds on Multiprocessing Timing Anomalies
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- On uniform \(k\)-partition problems
- Optimal Set Partitioning
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- The \(k\)-partitioning problem
- The exact LPT-bound for maximizing the minimum completion time
Cited in
(8)- The \(k\)-partitioning problem
- Some constrained partitioning problems and majorization
- \(\kappa\)-partitioning problems for maximizing the minimum load
- Optimal matroid partitioning problems
- Approximation algorithms for k-partitioning problems with partition matroid constraint
- A 3/2-approximation algorithm for k_i-partitioning
- Optimal matroid partitioning problems
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint
This page was built for publication: \(k\)-partitioning problems with partition matroid constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1022585)