• Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks 

      Langedal, Kenneth; Langguth, Johannes; Manne, Fredrik; Schroeder, Daniel Thilo (Journal article; Peer reviewed, 2022)
      Minimum weighted vertex cover is the NP-hard graph problem of choosing a subset of vertices incident to all edges such that the sum of the weights of the chosen vertices is minimum. Previous efforts for solving this in ...
    • Impacts of Covid-19 on Norwegian salmon exports: A firm-level analysis 

      Straume, Hans-Martin; Asche, Frank; Oglend, Atle; Abrahamsen, Eirik Bjorheim; Birkenbach, Anna M.; Langguth, Johannes; Lanquepin, Guillaume; Roll, Kristin Helen (Journal article; Peer reviewed, 2022)
      A rapidly growing literature investigates how the recent Covid-19 pandemic has affected international seafood trade along multiple dimensions, creating opportunities as well as challenges. This suggests that many of the ...
    • Optimizing Approximate Weighted Matching on Nvidia Kepler K40 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino; Langguth, Johannes (Chapter; Peer reviewed, 2018)
      Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand ...