909 search results - page 13 / 182 » On the approximability of some network design problems |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
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...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
IPL
2007
13 years 8 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...