1486 search results - page 45 / 298 » Algorithms for two-box covering |
101
click to vote
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
ESA
2003
Springer
15 years 6 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
159
Voted
DAM
2011
14 years 7 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
100
Voted
ECML
2005
Springer
15 years 6 months ago
2005
Springer
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...
107
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...