7930 search results - page 15 / 1586 » Greedy in Approximation Algorithms |
90
Voted
ALGORITHMICA
1999
14 years 11 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
127
click to vote
DATAMINE
2010
14 years 11 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
125
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
TPDS
2008
14 years 11 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...