2698 search results - page 155 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
170
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
190
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
182
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
176
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
239
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...