7129 search results - page 252 / 1426 » Approximation Algorithms for Treewidth |
124
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
132
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
120
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
144
click to vote
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
142
click to vote
ADHOCNOW
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...