1963 search results - page 356 / 393 » The Maximum Solution Problem on Graphs |
TCC
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
VEE
2012
ACM
12 years 5 months ago
2012
ACM
Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualiza...
INFOCOM
2012
IEEE
12 years 9 days ago
2012
IEEE
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...