ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...