4843 search results - page 80 / 969 » The Shortcut Problem - Complexity and Approximation |
MOC
1998
14 years 9 months ago
1998
Abstract. We consider a class of nonconforming finite element approximations of a simply laminated microstructure which minimizes the nonconvex variational problem for the deforma...
FLAIRS
2003
14 years 11 months ago
2003
This paper deals with the problem of merging descriptions of approximate spatial location specified at different levels of granularity. We distinguish between the roughness of an...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
MP
1998
14 years 9 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
TOC
2008
14 years 9 months ago
2008
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P