Sciweavers

7150 search results - page 65 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
107
Voted
TAMC
2007
Springer
15 years 6 months ago
Approximation Algorithms for 3D Orthogonal Knapsack
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...
108
Voted
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 1 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
ICPR
2006
IEEE
16 years 1 months ago
Approximation of Digital Curves using a Multi-Objective Genetic Algorithm
In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates...
Hervé Locteau, Romain Raveaux, Sébas...
COLING
2010
14 years 7 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
15 years 14 days ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson