5595 search results - page 794 / 1119 » Approximation Algorithms for Clustering Problems |
171
click to vote
PIMRC
2008
IEEE
16 years 1 months ago
2008
IEEE
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
150
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
179
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
177
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
174
click to vote
DAM
2011
15 years 1 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...