1 citations · 3 across the 6 of their papers we have counts for
4 papers · 1 filter
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis +4
The Minimum Vertex Cover problem is a fundamental combinatorial optimization problem, aiming to identify a minimum subset of vertices in a graph such that every edge is incident to…
Calibrations Scheduling Problem with Arbitrary Lengths and Activation Length
Eric Angel, Evripidis Bampis, Vincent Chau +1
Bender et al. (SPAA 2013) have proposed a theoretical framework for testing in contexts where safety mistakes must be avoided. Testing in such a context is made by machines that ne…
Throughput Maximization in Multiprocessor Speed-Scaling
Eric Angel, Evripidis Bampis, Vincent Chau +1
We are given a set of jobs that have to be executed on a set of speed-scalable machines that can vary their speeds dynamically using the energy model introduced in [Yao et…
Throughput Maximization in the Speed-Scaling Setting
Eric Angel, Evripidis Bampis, Vincent Chau
We are given a set of jobs and a single processor that can vary its speed dynamically. Each job is characterized by its processing requirement (work) , its release d…