455 search results - page 49 / 91 » A local approximation algorithm for maximum weight matching |
DISOPT
2010
14 years 9 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
108
click to vote
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
FLAIRS
2003
14 years 11 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...