628 search results - page 46 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
125
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
102
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
135
click to vote
SODA
2010
ACM
16 years 14 days ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
121
click to vote
PPSN
2004
Springer
15 years 8 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
119
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...