1 citations · 3 across the 12 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs
Anita Dürr, Nicolas El Maalouly, Lasse Wulf
In 1982 Papadimitriou and Yannakakis introduced the Exact Matching problem, in which given a red and blue edge-colored graph and an integer one has to decide whether there…
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…