Sciweavers

7006 search results - page 14 / 1402
» Approximation Algorithms
Sort
View
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
14 years 6 days ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...
DAM
2010
120views more  DAM 2010»
13 years 6 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
14 years 6 days ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
IPCO
2001
166views Optimization» more  IPCO 2001»
13 years 8 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
AAECC
2007
Springer
132views Algorithms» more  AAECC 2007»
13 years 6 months ago
Approximate implicitization of planar curves by piecewise rational approximation of the distance function
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
Mohamed Shalaby, Bert Jüttler, Josef Schicho