scientific article; zbMATH DE number 1055067
From MaRDI portal
Publication:4350159
zbMath0880.68050MaRDI QIDQ4350159
Publication date: 31 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items (13)
An exact algorithm for the budget-constrained multiple knapsack problem ⋮ The self-indexed search algorithm: a bit-level approach to minimal perfect hashing ⋮ Factor model for the study of complex processes ⋮ Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities ⋮ Optimal integer partitions ⋮ Unnamed Item ⋮ The CB tree: a practical concurrent self-adjusting search tree ⋮ Unnamed Item ⋮ Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates ⋮ A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets ⋮ Probabilistic analysis of algorithms for the Dutch national flag problem
This page was built for publication:
