1389 search results - page 49 / 278 » Improved Approximation Algorithms for Label Cover Problems |
117
Voted
ESA
2007
Springer
15 years 8 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
134
click to vote
KDD
2009
ACM
15 years 9 months ago
2009
ACM
Data mining techniques have become central to many applications. Most of those applications rely on so called supervised learning algorithms, which learn from given examples in th...
124
click to vote
COR
2007
15 years 2 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
131
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
112
Voted
DISOPT
2006
15 years 2 months ago
2006
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...