572 search results - page 24 / 115 » Exponential-Time Approximation of Hard Problems |
120
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
127
click to vote
NETWORKS
2006
15 years 2 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
128
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
121
click to vote
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
168
Voted
WEA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...