Approximating Min-Max (Regret) Versions of Some Polynomial Problems (Q3591305): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Cristina Bazgan / rank | |||
Property / author | |||
Property / author: Cristina Bazgan / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2124833419 / rank | |||
Normal rank |
Latest revision as of 21:15, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating Min-Max (Regret) Versions of Some Polynomial Problems |
scientific article |
Statements
Approximating Min-Max (Regret) Versions of Some Polynomial Problems (English)
0 references
10 September 2007
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