# Search results for: V.Th. Paschos

Discrete Applied Mathematics > 2013 > 161 > 4-5 > 558-572

Theoretical Computer Science > 2012 > 459 > Complete > 77-88

Discrete Applied Mathematics > 2012 > 160 > 13-14 > 1901-1913

Theoretical Computer Science > 2010 > 411 > 34-36 > 3055-3067

Theoretical Computer Science > 2009 > 410 > 21-23 > 2184-2195

Discrete Applied Mathematics > 2009 > 157 > 9 > 1988-1992

_{min}) in a complete (undirected) graph with edge weights 1 and 2 is considered. Polynomial time approximation algorithms are proposed with performance ratios 5/4 (in the case of one weight function) and 11/7 (in the case of two weight functions), respectively.

Discrete Applied Mathematics > 2009 > 157 > 4 > 819-832

Operations Research Letters > 2007 > 35 > 3 > 403-408

European Journal of Operational Research > 2006 > 172 > 3 > 719-739

Discrete Applied Mathematics > 2005 > 146 > 1 > 3-26

Applied Mathematics Letters > 2003 > 16 > 5 > 733-739

^{-}

^{ε}for any ε ε (0, 1), where V and N are the vertex-set of the input graph and the set of terminal vertices, respectively. For the second of the Steiner tree versions considered, the...