Matches in SemOpenAlex for { <https://semopenalex.org/work/W1567880067> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W1567880067 endingPage "470" @default.
- W1567880067 startingPage "461" @default.
- W1567880067 abstract "We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic concept used in practice. These algorithms start with the computation of an optimal fractional solution that has only one fractional item and then they exchange items until an optimal integral solution is found. The idea is that in many cases the optimal integral solution should be close to the fractional one such that only a few items need to be exchanged. Despite the well known hardness of the knapsack problem on worst-case instances, practical studies show that knapsack core algorithms can solve large scale instances very efficiently. For example, they exhibit almost linear running time on purely random inputs.In this paper, we present the first theoretical result on the running time of core algorithms that comes close to the results observed in practical experiments. We prove an upper bound of O(npolylog(n)) on the expected running time of a core algorithm on instances with n items whose profits and weights are drawn independently, uniformly at random. A previous analysis on the average-case complexity of the knapsack problem proves a running time of O(n4), but for a different kind of algorithms. The previously best known upper bound on the running time of core algorithms is polynomial as well. The degree of this polynomial, however, is at least a large three digit number. In addition to uniformly random instances, we investigate harder instances in which profits and weights are pairwise correlated. For this kind of instances, we can prove a tradeoff describing how the degree of correlation influences the running time." @default.
- W1567880067 created "2016-06-24" @default.
- W1567880067 creator A5033062760 @default.
- W1567880067 creator A5066021048 @default.
- W1567880067 date "2004-01-01" @default.
- W1567880067 modified "2023-09-26" @default.
- W1567880067 title "Probabilistic Analysis of Knapsack Core Algorithms" @default.
- W1567880067 hasPublicationYear "2004" @default.
- W1567880067 type Work @default.
- W1567880067 sameAs 1567880067 @default.
- W1567880067 citedByCount "0" @default.
- W1567880067 crossrefType "journal-article" @default.
- W1567880067 hasAuthorship W1567880067A5033062760 @default.
- W1567880067 hasAuthorship W1567880067A5066021048 @default.
- W1567880067 hasConcept C105795698 @default.
- W1567880067 hasConcept C113138325 @default.
- W1567880067 hasConcept C11413529 @default.
- W1567880067 hasConcept C120665830 @default.
- W1567880067 hasConcept C121332964 @default.
- W1567880067 hasConcept C134306372 @default.
- W1567880067 hasConcept C17722475 @default.
- W1567880067 hasConcept C192209626 @default.
- W1567880067 hasConcept C2164484 @default.
- W1567880067 hasConcept C24404364 @default.
- W1567880067 hasConcept C311688 @default.
- W1567880067 hasConcept C33923547 @default.
- W1567880067 hasConcept C41008148 @default.
- W1567880067 hasConcept C49937458 @default.
- W1567880067 hasConcept C76155785 @default.
- W1567880067 hasConcept C77553402 @default.
- W1567880067 hasConcept C94569963 @default.
- W1567880067 hasConceptScore W1567880067C105795698 @default.
- W1567880067 hasConceptScore W1567880067C113138325 @default.
- W1567880067 hasConceptScore W1567880067C11413529 @default.
- W1567880067 hasConceptScore W1567880067C120665830 @default.
- W1567880067 hasConceptScore W1567880067C121332964 @default.
- W1567880067 hasConceptScore W1567880067C134306372 @default.
- W1567880067 hasConceptScore W1567880067C17722475 @default.
- W1567880067 hasConceptScore W1567880067C192209626 @default.
- W1567880067 hasConceptScore W1567880067C2164484 @default.
- W1567880067 hasConceptScore W1567880067C24404364 @default.
- W1567880067 hasConceptScore W1567880067C311688 @default.
- W1567880067 hasConceptScore W1567880067C33923547 @default.
- W1567880067 hasConceptScore W1567880067C41008148 @default.
- W1567880067 hasConceptScore W1567880067C49937458 @default.
- W1567880067 hasConceptScore W1567880067C76155785 @default.
- W1567880067 hasConceptScore W1567880067C77553402 @default.
- W1567880067 hasConceptScore W1567880067C94569963 @default.
- W1567880067 hasLocation W15678800671 @default.
- W1567880067 hasOpenAccess W1567880067 @default.
- W1567880067 hasPrimaryLocation W15678800671 @default.
- W1567880067 hasRelatedWork W1530649098 @default.
- W1567880067 hasRelatedWork W157591503 @default.
- W1567880067 hasRelatedWork W1971967801 @default.
- W1567880067 hasRelatedWork W2004030424 @default.
- W1567880067 hasRelatedWork W2019110169 @default.
- W1567880067 hasRelatedWork W2043033472 @default.
- W1567880067 hasRelatedWork W2069031805 @default.
- W1567880067 hasRelatedWork W2078007422 @default.
- W1567880067 hasRelatedWork W2319192565 @default.
- W1567880067 hasRelatedWork W2415059730 @default.
- W1567880067 hasRelatedWork W2581538892 @default.
- W1567880067 hasRelatedWork W2607421980 @default.
- W1567880067 hasRelatedWork W2783412970 @default.
- W1567880067 hasRelatedWork W2788809454 @default.
- W1567880067 hasRelatedWork W2799046353 @default.
- W1567880067 hasRelatedWork W2963897343 @default.
- W1567880067 hasRelatedWork W3085845473 @default.
- W1567880067 hasRelatedWork W3172926224 @default.
- W1567880067 hasRelatedWork W3173557077 @default.
- W1567880067 hasRelatedWork W59554375 @default.
- W1567880067 isParatext "false" @default.
- W1567880067 isRetracted "false" @default.
- W1567880067 magId "1567880067" @default.
- W1567880067 workType "article" @default.