Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem (Q1577475): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank | |||
Normal rank | |||
Latest revision as of 13:41, 30 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem |
scientific article |
Statements
Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem (English)
0 references
22 November 2000
0 references
approximation algorithm
0 references
Greedy algorithm
0 references
worst-case analysis
0 references
0 references
