1647 search results - page 128 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
194
click to vote
SWAT
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
147
Voted
CPM
2004
Springer
15 years 8 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
121
Voted
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
153
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
172
click to vote
TSP
2012
14 years 15 days ago
2012
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...