Sciweavers

613 search results - page 22 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
ENDM
2010
136views more  ENDM 2010»
13 years 7 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
JUCS
2010
117views more  JUCS 2010»
13 years 6 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
IPPS
2002
IEEE
14 years 15 days ago
A New Estimation Method for Distributed Java Object Activity
We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part...
Amer Bouchi, Richard Olejnik, Bernard Toursel
ICALP
2005
Springer
14 years 1 months ago
Approximation Algorithms for Euclidean Group TSP
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H....