7930 search results - page 107 / 1586 » Greedy in Approximation Algorithms |
174
click to vote
IASTEDSE
2004
15 years 7 months ago
2004
Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate test suites for pairwise coverage are evaluated according ...
175
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
163
click to vote
AAIM
2007
Springer
16 years 14 days ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
187
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...