982 search results - page 130 / 197 » Solving Steiner tree problems in graphs to optimality |
136
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
104
Voted
ICDE
2000
IEEE
15 years 5 months ago
2000
IEEE
The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and f...
ASPDAC
2001
ACM
15 years 4 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
102
Voted
AINA
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we intend to solve the problem of maximum-revenue multicast routing with a partial admission control mechanism for multirate multimedia distribution. Specifically, ...