3019 search results - page 201 / 604 » Approximating the Domatic Number |
169
click to vote
GLOBECOM
2007
IEEE
16 years 23 days ago
2007
IEEE
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
176
click to vote
WEA
2007
Springer
16 years 16 days ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
155
click to vote
DATE
2006
IEEE
16 years 14 days ago
2006
IEEE
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
179
click to vote
ICDCS
2006
IEEE
16 years 14 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
145
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...