79 search results - page 14 / 16 » Minimum Dominating Set Approximation in Graphs of Bounded Ar... |
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
SIAMDM
2008
13 years 7 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
AIPS
2004
13 years 9 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...