34 search results - page 7 / 7 » A Near-Tight Bound for the Online Steiner Tree Problem in Gr... |
ALGORITHMICA
1998
13 years 4 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
GD
2007
Springer
13 years 11 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...