4 papers
Compact enumeration for scheduling one machine
Nodari Vakhania
A Variable Parameter (VP) analysis, that we introduce here, aims to give a precise algorithm time complexity expression in which an exponent appears solely in terms of a variable p…
An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
Nodari Vakhania, Frank Werner, Kevin Johedan RamÃrez-Fuentes +1
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems appeared. They addressed many heuristics…
An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem
VÃctor Pacheco-Valencia, Nodari Vakhania
In the Bounded Multiple Traveling Salesman Problem (BMTSP), a tour for each salesman, that starts and ends at the depot and that respects the bounds on the number of cities that a…
Reducing Dominating Sets in Graphs
Ernesto Parra Inza, José MarÃa Sigarreta Almira, Nodari Vakhania
A dominating set of a graph is a subset of vertices such that every vertex has at least one neighbor in set . The corresponding opti…