- Sprache
-
Englisch
- Identifier
-
1251949681
- Reihe
-
Angewandte Mathematik und Informatik, Universität zu Köln; Report No. 93.146
Beteiligte Personen und Organisationen
Srivastav, Anand
Stangier, Peter
Stangier, Peter
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:57 MEZ
Objekttyp
- Monografie
Beteiligte
- Srivastav, Anand
- Stangier, Peter
Ähnliche Objekte (12)
On Derandomized Approximation Algorithms
Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming
Weighted Fractional and Integral k-Matching in Hypergraphs
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
Block Sieving Algorithms
Provably good solutions for the traveling salesman problem
Temporal Index Sharding for Space-time Efficiency in Archive Search
Phrase Query Optimization on Inverted Indexes
Nurbs-based elements as a basis for integrating engineering applications
On Derandomized Approximation Algorithms
Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming
Weighted Fractional and Integral k-Matching in Hypergraphs
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
Block Sieving Algorithms
Provably good solutions for the traveling salesman problem
Temporal Index Sharding for Space-time Efficiency in Archive Search
Phrase Query Optimization on Inverted Indexes
Nurbs-based elements as a basis for integrating engineering applications
On Derandomized Approximation Algorithms
Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming
Weighted Fractional and Integral k-Matching in Hypergraphs
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
Block Sieving Algorithms
Provably good solutions for the traveling salesman problem
Temporal Index Sharding for Space-time Efficiency in Archive Search
Phrase Query Optimization on Inverted Indexes