1158 search results - page 49 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
156
Voted
TAMC
2007
Springer
16 years 1 days ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
177
click to vote
ENDM
2010
15 years 6 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
174
click to vote
DCOSS
2006
Springer
15 years 9 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
239
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
156
Voted
PODS
2010
ACM
15 years 11 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...