1046 search results - page 12 / 210 » Approximation Algorithms for Domination Search |
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
115
click to vote
CCCG
2010
15 years 1 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
COLING
2010
14 years 6 months ago
2010
Multi-document summarization aims to distill the most important information from a set of documents to generate a compressed summary. Given a sentence graph generated from a set o...