Paschos Vangelis Th

Vangelis Th Paschos

Information about the author Vangelis Th Paschos will soon be added to the site.
Found 8 papers in total
Dual parameterization and parameterized approximability of subset graph problems
Dual parameterization and parameterized approximability of subset graph problems
2017
We discuss approximability in FPT‐time for the class of subset optimization...
Asymptotic differential approximation ratio:Definitions, motivations and application to some combinatorial problems
Asymptotic differential approximation ratio:Definitions, motivations and application to some combinatorial problems
1999
We first motivate and define a notion of asymptotic differential approximation ratio....
Approximating the metric 2-peripatetic salesman problem
Approximating the metric 2-peripatetic salesman problem
2010
This paper deals with the 2-Peripatetic Salesman Problem for the case where costs...
Probabilistic optimization in graph-problems
Probabilistic optimization in graph-problems
2010
We study a probabilistic optimization model for graph-problems under...
Probabilistic models for the Steiner Tree problem
Probabilistic models for the Steiner Tree problem
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model, the...
An overview on polynomial approximation of NP-hard problems
An overview on polynomial approximation of NP-hard problems
2009
The fact that polynomial time algorithm is very unlikely to be devised for an optimal...
Simple and fast reoptimizations for the Steiner tree problem
Simple and fast reoptimizations for the Steiner tree problem
2009
We address reoptimization issues for the Steiner tree problem. We assume that an...
Greedy algorithms for on-line set-covering
Greedy algorithms for on-line set-covering
2009
We study on-line models for the set-covering problem in which items from a ground set...
Papers per page: