Approximation Algorithms for Some Postman Problems (Q4191881): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322139.322150 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062403584 / rank | |||
Normal rank | |||
Latest revision as of 20:25, 19 March 2024
scientific article; zbMATH DE number 3630508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for Some Postman Problems |
scientific article; zbMATH DE number 3630508 |
Statements
Approximation Algorithms for Some Postman Problems (English)
0 references
1979
0 references
Traveling Salesman Problem
0 references
Worst-Case Behavior
0 references
Estimation of Execution Time
0 references
Np-Complete Problem
0 references
Postman Problem
0 references
Heuristic Algorithm
0 references
Chinese Postman Problem
0 references
Rural Postman Problem
0 references
