General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q319417 |
Changed an Item |
||
| Property / author | |||
| Property / author: Daniel Vanderpooten / rank | |||
Normal rank | |||
Revision as of 06:09, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems |
scientific article |
Statements
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (English)
0 references
20 June 2012
0 references
min-max
0 references
min-max regret
0 references
approximation
0 references
fptas
0 references
shortest path
0 references
minimum spanning tree
0 references
knapsack
0 references
minimum weighted perfect matching
0 references
