This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...