2698 search results - page 296 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
165
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
170
click to vote
JCO
2006
15 years 6 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
179
click to vote
GD
1999
Springer
15 years 11 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
189
click to vote
MDM
2009
Springer
16 years 1 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
186
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...