49 citations · 71 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
A - Approximation Algorithm for the Maximum Traveling Salesman Problem
Szymon Dudycz, Jan Marcinkowski, Katarzyna Paluch +1
In the maximum traveling salesman problem (Max TSP) we are given a complete undirected graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour…
cs.DS2015
Characterisation of Strongly Stable Matchings
Pratik Ghosal, Adam Kunysz, Katarzyna Paluch
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph , with an adjacency list of each vertex being a linearly ordered list of…