QUBO formulations of the longest path problem

2021 ◽  
Vol 863 ◽  
pp. 86-101
Author(s):  
Joey McCollum ◽  
Thomas Krauss
Keyword(s):  
Longest Path ◽  
Longest Path Problem

scholarly journals A linear-time algorithm for the longest path problem in rectangular grid graphs

2012 ◽  
Vol 160 (3) ◽  
pp. 210-217 ◽  
Author(s):  
Fatemeh Keshavarz-Kohjerdi ◽  
Alireza Bagheri ◽  
Asghar Asgharian-Sardroud
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Rectangular Grid ◽  
Grid Graphs ◽  
Longest Path ◽  
Longest Path Problem

scholarly journals The Longest Path Problem Is Polynomial on Cocomparability Graphs

Algorithmica ◽  
2011 ◽  
Vol 65 (1) ◽  
pp. 177-205 ◽  
Author(s):  
Kyriaki Ioannidou ◽  
Stavros D. Nikolopoulos
Keyword(s):  
Longest Path ◽  
Longest Path Problem ◽  
Cocomparability Graphs

Solving the Longest Path Problem Using a Biologically DNA Computational Model

2015 ◽  
Vol 12 (6) ◽  
pp. 1096-1099
Author(s):  
Kai Zhao ◽  
Jun Pu ◽  
Zhaocai Wang ◽  
Huajun Meng
Keyword(s):  
Computational Model ◽  
Longest Path ◽  
Longest Path Problem

The probabilistic longest path problem

Networks ◽  
1999 ◽  
Vol 33 (3) ◽  
pp. 207-219 ◽  
Author(s):  
C�cile Murat ◽  
Vangelis Th. Paschos
Keyword(s):  
Longest Path ◽  
Longest Path Problem

scholarly journals On the Performance of a Simple Approximation Algorithm for the Longest Path Problem

2019 ◽  
Vol 35 (1) ◽  
pp. 57-68
Author(s):  
Nguyen Thi Phuong ◽  
Tran Vinh Duc ◽  
Le Cong Thanh
Keyword(s):  
Approximation Algorithms ◽  
Approximation Algorithm ◽  
Polynomial Time ◽  
Undirected Graph ◽  
Simple Algorithm ◽  
Performance Ratio ◽  
Constant Ratio ◽  
Time Approximation ◽  
Longest Path ◽  
Longest Path Problem

The longest path problem is known to be NP-hard. Moreover, they cannot be approximated within a constant ratio, unless ${\rm P=NP}$. The best known polynomial time approximation algorithms for this problem essentially find a path of length that is the logarithm of the optimum.In this paper we investigate the performance of an approximation algorithm for this problem in almost every case. We show that a simple algorithm, based on depth-first search, finds on almost every undirected graph $G=(V,E)$ a path of length more than $|V|-3\sqrt{|V| \log |V|}$ and so has performance ratio less than $1+4\sqrt{\log |V|/|V|}$.\

Continuous Fuzzy Longest Path Problem in Project Networks

2008 ◽  
Vol 8 (22) ◽  
pp. 4061-4069 ◽  
Author(s):  
K. Ghoseiri ◽  
A.R.J. Moghadam
Keyword(s):  
Project Networks ◽  
Longest Path ◽  
Longest Path Problem
Sign in / Sign up

Export Citation Format

Share Document