- Language
-
Englisch
- Identifier
-
1251949657
- Series
-
Angewandte Mathematik und Informatik, Universität zu Köln; Report No. 92.122
Contributor
Srivastav, Anand
Stangier, Peter
Stangier, Peter
- URN
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
26.01.2023, 1:55 PM CET
Object type
- Monografie
Associated
- Srivastav, Anand
- Stangier, Peter
Other Objects (12)
Integer Multicommodity Flows with Reduced Demands
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming
Weighted Fractional and Integral k-Matching in Hypergraphs
Block Sieving Algorithms
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
Provably good solutions for the traveling salesman problem
Approximation algorithms for intersection graphs
Temporal Index Sharding for Space-time Efficiency in Archive Search
Phrase Query Optimization on Inverted Indexes
Integer Multicommodity Flows with Reduced Demands
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming
Weighted Fractional and Integral k-Matching in Hypergraphs
Block Sieving Algorithms
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
Provably good solutions for the traveling salesman problem
Approximation algorithms for intersection graphs
Temporal Index Sharding for Space-time Efficiency in Archive Search
Phrase Query Optimization on Inverted Indexes
Integer Multicommodity Flows with Reduced Demands
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming
Weighted Fractional and Integral k-Matching in Hypergraphs
Block Sieving Algorithms
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
Provably good solutions for the traveling salesman problem
Approximation algorithms for intersection graphs
Temporal Index Sharding for Space-time Efficiency in Archive Search