Pages that link to "Item:Q408403"
From MaRDI portal
The following pages link to A 3/2-approximation algorithm for \(k_i\)-partitioning (Q408403):
Displaying 14 items.
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- The \(k\)-partitioning problem (Q1298757) (← links)
- A tight bound for 3-partitioning (Q1309812) (← links)
- Three-partitioning containing kernels: Complexity and heuristic (Q1924322) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q2309472) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint (Q2448182) (← links)
- Operations research models for coalition structure in collaborative logistics (Q2629609) (← links)
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints (Q2958349) (← links)
- Three Partition Refinement Algorithms (Q3801084) (← links)
- EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)
- A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width (Q6487362) (← links)
- Online cardinality constrained scheduling (Q6556169) (← links)