research
∙
11/13/2022
Exact and Approximation Algorithms for the Domination Problem
In a simple connected graph G=(V,E), a subset of vertices S ⊆ V is a dom...
share
research
∙
11/03/2022
Variable Parameter Analysis for Scheduling One Machine
In contrast to the fixed parameter analysis (FPA), in the variable param...
research
∙
07/10/2022
A polynomial-time approximation to a minimum dominating set in a graph
A dominating set of a graph G=(V,E) is a subset of vertices S⊆ V such th...
research
∙
05/04/2022
On Preemptive Scheduling of Unrelated Machines Using Linear Programming
We consider a basic problem of preemptive scheduling of n non-simultaneo...
research
∙
03/18/2022
Scheduling a single machine with compressible jobs to minimize maximum lateness
The problem of scheduling non-simultaneously released jobs with due date...
research
∙
03/17/2021
