The following pages link to (Q3140449):
Displaying 15 items.
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Energy-efficient multiprocessor scheduling for flow time and makespan (Q401300) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics (Q433416) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Minimal cost reconfiguration of data placement in a storage area network (Q690477) (← links)
- Minimizing average flow-time under knapsack constraint (Q896150) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- Resource constrained scheduling on multiple machines (Q2390306) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- Task scheduling in networks (Q5054769) (← links)
- The constrained minimum spanning tree problem (Q5054807) (← links)
- On-line scheduling of parallel jobs (Q5096875) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
