2137 search results - page 136 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
119
Voted
AAIM
2008
Springer
15 years 11 months ago
2008
Springer
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
130
click to vote
DCOSS
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
182
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
161
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 5 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
148
click to vote
VLDB
1991
ACM
15 years 8 months ago
1991
ACM
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...