activity
20172024
most citedCombinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases

5 citations · 10 across the 9 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

cs.DS2023★ 1 cited

A linear time algorithm for linearizing quadratic and higher-order shortest path problems

Eranda Çela, Bettina Klinz, Stefan Lendl +2

An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest Path Problem (SPP) on the same…