628 search results - page 40 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
133
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
157
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
160
Voted
ISPEC
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
203
Voted
APPROX
2000
Springer
15 years 9 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
120
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...