The following pages link to Evripidis Bampis (Q398883):
Displayed 50 items.
- Item:Q398883 (redirect page) (← links)
- Speed scaling for maximum lateness (Q255271) (← links)
- Throughput maximization in multiprocessor speed-scaling (Q278716) (← links)
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- On multiprocessor temperature-aware scheduling problems (Q398885) (← links)
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines (Q401128) (← links)
- From preemptive to non-preemptive speed-scaling scheduling (Q479009) (← links)
- Scheduling tasks with small communication delays for clusters of processors (Q596450) (← links)
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks (Q672453) (← links)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
- Randomized truthful algorithms for scheduling selfish tasks on parallel machines (Q764300) (← links)
- The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
- Fair cost-sharing methods for the minimum spanning tree game (Q845820) (← links)
- Truthful algorithms for scheduling selfish tasks on parallel machines (Q861258) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- How good are SPT schedules for fair optimality criteria (Q940873) (← links)
- Bicriteria scheduling for contiguous and non contiguous parallel tasks (Q940878) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- Minimizing the overhead for some tree-scheduling problems (Q1278303) (← links)
- Minimizing the schedule length for a parallel 3D-grid precedence graph (Q1278401) (← links)
- A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems (Q1285548) (← links)
- Scheduling UET-UCT series-parallel graphs on two processors (Q1365936) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- Energy-efficient scheduling and routing via randomized rounding (Q1617291) (← links)
- Scheduling on power-heterogeneous processors (Q1680505) (← links)
- Non-preemptive throughput maximization for speed-scaling with power-down (Q1693044) (← links)
- Throughput maximization for speed scaling with agreeable deadlines (Q1702723) (← links)
- Scheduling in switching networks with set-up delays (Q1774526) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications (Q1853631) (← links)
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem (Q1884968) (← links)
- Online multistage subset maximization problems (Q2041973) (← links)
- Calibrations scheduling with arbitrary lengths and activation length (Q2066688) (← links)
- A simple rounding scheme for multistage optimization (Q2077374) (← links)
- Target-based computer-assisted orchestration: complexity and approximation algorithms (Q2079398) (← links)
- LP-based algorithms for multistage minimization problems (Q2117680) (← links)
- Multistage knapsack (Q2119404) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- Correction to: approximation and online algorithms (Q2193096) (← links)
- Impact of communications of the complexity of the parallel Gaussian elimination (Q2277765) (← links)
- Green scheduling, flows and matchings (Q2344761) (← links)
- Speed scaling on parallel processors with migration (Q2424726) (← links)
- An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Optimal data placement on networks with a constant number of clients (Q2453166) (← links)
- Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)