Pages that link to "Item:Q3990102"
From MaRDI portal
The following pages link to Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling (Q3990102):
Displaying 17 items.
- Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems (Q817816) (← links)
- Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
- An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- An algebraic expression of the number partitioning problem (Q2197434) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks (Q2497732) (← links)
- Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling (Q3329209) (← links)
- Proof of the local REM conjecture for number partitioning. I: Constant energy scales (Q3619613) (← links)
- Approximating Scheduling Machines with Capacity Constraints (Q5321720) (← links)
- (Q5708542) (← links)
- A physicist's approach to number partitioning (Q5958802) (← links)
- Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)
