The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Diffusion-Weighted MRI (DW-MRI) is subject to random noise yielding measures that are different from their real values, and thus biasing the subsequently estimated tensors. The Non...
—To approximate the exact peaks of continuous-time orthogonal frequency division multiplexing (OFDM) signals, four times oversampling is usually employed for discrete-time OFDM s...