Sciweavers

7930 search results - page 15 / 1586
» Greedy in Approximation Algorithms
Sort
View
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
13 years 7 months ago
Approximating Latin Square Extensions
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 ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 7 months ago
Extracting influential nodes on a social network for information diffusion
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...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
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...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
TPDS
2008
136views more  TPDS 2008»
13 years 7 months ago
Data Gathering with Tunable Compression in Sensor Networks
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 ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
INFOCOM
2009
IEEE
14 years 2 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
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...
Liqun Fu, Soung Chang Liew, Jianwei Huang