1158 search results - page 57 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
160
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
161
click to vote
SECON
2010
IEEE
15 years 2 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
162
Voted
WADS
2007
Springer
15 years 10 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
151
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
149
click to vote
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...