628 search results - page 85 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
122
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
159
click to vote
ISPD
1997
ACM
15 years 7 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
129
click to vote
JMLR
2010
14 years 9 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
111
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
120
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...