On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours (Q924547): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The algebraic degree of geometric optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The geometric maximum traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3794956 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast approximations for sums of distances, clustering and the Fermat-Weber problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving a "Hard" problem to approximate an "Easy" one / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On minimum stars and maximum matchings. / rank | |||
Normal rank | |||
Latest revision as of 09:09, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours |
scientific article |
Statements
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours (English)
0 references
16 May 2008
0 references
approximation algorithms
0 references
longest Hamiltonian cycle
0 references
geometric algorithms
0 references
