Complexity and in-approximability of a selection problem in robust optimization (Q385465): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Min-max and min-max (relative) regret approaches to representatives selection problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust discrete optimization and its applications / rank | |||
Normal rank | |||
Revision as of 02:39, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and in-approximability of a selection problem in robust optimization |
scientific article |
Statements
Complexity and in-approximability of a selection problem in robust optimization (English)
0 references
2 December 2013
0 references
combinatorial optimization
0 references
computational complexity
0 references
robust optimization
0 references
NP-hardness
0 references
inapproximability
0 references
