Finding Optimal Longest Paths by Dynamic Programming in Parallel

05/08/2019
by   Kai Fieger, et al.
0

We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This enables us to solve instances that were previously unsolved and solve hard instances significantly faster. Lastly, we present a scalable parallelization which yields the first efficient parallel algorithm for the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2018

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms

In this paper we study quantum algorithms for NP-complete problems whose...
research
09/18/2020

Delay Optimization of Combinational Logic by And-Or Path Restructuring

We propose a dynamic programming algorithm that constructs delay-optimiz...
research
03/21/2019

An empirical analysis of exact algorithms for the unbounded knapsack problem

This work presents an empirical analysis of exact algorithms for the unb...
research
04/27/2021

Fully-dynamic Weighted Matching Approximation in Practice

Finding large or heavy matchings in graphs is a ubiquitous combinatorial...
research
12/19/2018

Dynamic Programming Approach to Template-based OCR

In this paper we propose a dynamic programming solution to the template-...
research
01/31/2013

Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations

The Frame-Stewart algorithm for the 4-peg variant of the Tower of Hanoi,...
research
03/10/2021

A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems

It has been shown that the parallel Lattice Linear Predicate (LLP) algor...

Please sign up or login with your details

Forgot password? Click here to reset