7150 search results - page 88 / 1430 » An Approximation Algorithm for Approximation Rank |
103
click to vote
ICALP
1998
Springer
15 years 4 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
101
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
86
Voted
CCCG
2007
15 years 2 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
83
Voted
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...