101 search results - page 9 / 21 » Optimal Random Matchings on Trees and Applications |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
CAAN
2006
Springer
13 years 11 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
CPM
2004
Springer
14 years 27 days ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...