W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1+# in linear time. Combinatorica, 1(4):349--355, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Polynomial Time Approximation Schemes for Euclidean Traveling.. - Arora (1996) (166 citations) (Correct)
....can approximate the problem within a factor 1 1 c. The running time could depend upon c, but for each fixed c has to be polynomial in the input size. PTAS s are known for very few problems; two important ones are Subset Sum (Ibarra and Kim [32] and Bin Packing (Fernandez de la Vega and Lueker [18]; see also Karmarkar and Karp [37] Recently Arora, Lund, Motwani, Sudan, and Szegedy [5] showed that if P #= NP, then metric TSP and many other problems do not have a PTAS. Their work relied upon the theory of MAX SNPcompleteness (Papadimitriou and Yannakakis [53] the notion of ....
W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1+# in linear time. Combinatorica, 1(4):349--355, 1981.
Hippodrome: Running Circles Around Storage Administration - Anderson, Hobbs, Keeton.. (2002) (46 citations) (Correct)
....a number of stores, with both capacity and performance requirements, onto disk arrays is similar to the problem of multi dimensional bin packing. Since bin packing is an NP complete problem, exhaustive searches would take too long. Therefore our solver builds on the best fit approaches found in [15, 21, 23] to produce initial solutions, and adds backtracking to help the solver avoid local minima in the search space of possible designs. The solver algorithm has three phases: 1. Initial assignment. This phase attempts to find an initial, valid solution. It first randomizes the list of input stores, ....
W. Fernandez and G. Lueker. Bin packing can be solved within 1+# in linear time. Combinatorica, 1(4):349--55, 1981.
Selecting RAID levels for disk arrays - Anderson, Swaminathan, Veitch, A. (2002) (11 citations) (Correct)
....solver examines each store, and tags it with a RAID level based on the attributes of the store and associated streams. During the initial assignment phase, Ergastulum explores the array design search space by first randomizing the order of the stores, and then running a best fit search algorithm [10, 15, 16] that assigns one store at a time into a tentative array design. Given two possible assignments of a store onto different LUs, the solver uses an externally selected goal function to choose the best assignment. While searching for the best placement of a store, the solver will try to assign it ....
W. Fernandez de la Vega and G. Lueker. Bin packing can be solved within 1+# in linear time. Combinatorica, 1(4):349--355, 1981.
The Approximability of NP-hard Problems - Arora (1998) (7 citations) (Correct)
....and showed that most NP hard problems of interest do not have FPTAS s if P #= NP. Some preliminary work was also done on classifying problems according to approximability [14, 15, 16] The early 1980s saw further success in design of algorithms, including Fernandez de la Vega and Lueker s PTAS [53] and Karmarkar and Karp s FPTAS [84] for BIN PACKING 1 , PTAS s for some geometric packing and covering problems (see the chapter by Hochbaum in [75] for a survey) and for various problems on planar graphs [102, 22] Planar graphs are easier to treat because they have small separators. ....
W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1+# in linear time. Combinatorica:1(4), 349--355, 1981.
Polynomial Time Approximation Schemes for Dense.. - Arora, Karger, Karpinski (1995) (111 citations) (Correct)
....with approximation ratios close to O(log n) No inapproximability results are known for them. MAX SNP problems, such as MAX CUT or MAX 3 SAT, can be approximated to within some fixed constant factor but no better [PY91, ALM 92] Only a few problems, such as KNAPSACK [S75] and BIN PACKING [FL81] are known to have polynomial time approximation schemes (PTASs) A PTAS is an algorithm that, for every fixed # 0, achieves an approximation ratio of 1 # in time that is polynomial in the input size (but could grow very fast with 1 #, such as O(n 1 # ) A PTAS thus allows us to trade o# ....
W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1+# in linear time. Combinatorica:1(4), 349--355, 1981.
Polynomial Time Approximation Schemes for Euclidean Traveling.. - Arora (1996) (166 citations) (Correct)
.... 1, can approximate the problem within a factor 1 1 c. The running time could depend upon c, but for each fixed c has to be polynomial in the input size. PTAS s are known for very few problems; two important ones are SubsetSum (Ibarra and Kim [31] and Bin Packing (Fernandez de la Vega and Lueker [17]; see also Karmarkar and Karp [36] Recently Arora, Lund, Motwani, Sudan, and Szegedy [5] showed that if P #= NP, then metric TSP and many other problems do not have a PTAS. Their work relied upon the theory of MAX SNP completeness (Papadimitriou and Yannakakis [52] the notion of ....
W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1+# in linear time. Combinatorica, 1(4):349--355, 1981.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC