Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

APPML
2006

favoriteEmaildiscussreport

73views more APPML 2006»

Threshold arrangements and the knapsack problem

13 years 11 months ago

Threshold arrangements and the knapsack problem

Download page.mi.fu-berlin.de

We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs, threshold arrangements, and other well-studied combinatorial objects, and we correct an error in the analysis given in that paper.

Günter Rote, André Schulz

Real-time Traffic

APPML 2006 | Combinatorial Question | Lower Bounds | Well-studied Combinatorial Objects |

claim paper

Related Content

» On Threshold BDDs and the Optimal Variable Ordering Problem

» Algorithm for stochastic multiplechoice knapsack problem and application to keywords biddi...

» A knapsack problem formulation for relay selection in secure cooperative wireless communic...

» Methods for decreasing the number of objective evaluations for independent computationally...

» Error Thresholds in Genetic Algorithms

» QoSAware Composition of Web Services An Evaluation of Selection Algorithms

» Reconstruction of 3D Structures from Protein Contact Maps

» A combinatorial optimization framework for subset selection in distributed multipleradar a...

» On optimal anonymization for ldiversity

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	APPML
Authors	Günter Rote, André Schulz

Comments (0)