On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint (Q687374): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q5514188 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3737235 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Totally-Balanced and Greedy Matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Greedy packing and series-parallel graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040221 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90555-t / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4213257218 / rank | |||
Normal rank | |||
Latest revision as of 09:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint |
scientific article |
Statements
On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint (English)
0 references
8 December 1993
0 references
greedy algorithm
0 references
covering
0 references
packing
0 references
shortest path
0 references
minimum spanning tree
0 references
