3 papers
math.CO2020
Mapping Matchings to Minimum Vertex Covers: Kőnig's Theorem Revisited
Jacob Turner
It is a celebrated result in early combinatorics that, in bipartite graphs, the size of maximum matching is equal to the size of a minimum vertex cover. Kőnig's proof of this fact…
cs.DS2019
Combining the Connection Scan Algorithm with Contraction Hierarchies
Jacob Turner
Since the first solutions finding minimally weighted routes in weighted digraphs, a plethora of literature has appeared improving the performance of shortest-path queries for use i…
cs.GT2018
A New Optimization Layer for Real-Time Bidding Advertising Campaigns
Gianluca Micchi, Saeid Soheily-Khah, Jacob Turner
While it is relatively easy to start an online advertising campaign, obtaining a high Key Performance Indicator (KPI) can be challenging. A large body of work on this subject has a…