Finding the largest triangle in a graph in expected quadratic time
Year of publication: |
2020
|
---|---|
Authors: | Lancia, Giuseppe ; Vidoni, Paolo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 286.2020, 2 (16.10.), p. 458-467
|
Subject: | 3-OPT TSP neighborhood | Applied probability | Combinatorial optimization | Max weight triangle | Probabilistic analysis of algorithms | Wahrscheinlichkeitsrechnung | Probability theory | Algorithmus | Algorithm | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
Frieze, Alan, (2021)
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
-
Extended formulations for perfect domination problems and their algorithmic implications
Forte, VinÃcius Leal do, (2023)
- More ...
-
Lancia, Giuseppe, (2000)
-
Compact vs. exponential-size LP relaxations
Carr, Robert D., (2002)
-
A polynomial case of the parsimony haplotyping problem
Lancia, Giuseppe, (2006)
- More ...