Items where Year is 2018
![]() | Up a level |
G
Groß, Martin and Gupta, Anupam and Kumar, Amit and Matuschke, Jannik and Schmidt, Daniel R. and Schmidt, Melanie and Verschae, José
(2018)
A Local-Search Algorithm for Steiner Forest.
Published In:
9th Innovations in Theoretical Computer Science Conference (ITCS 2018), Leibniz International Proceedings in Informatics (LIPIcs). 94 Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 2018, 31:1-31:17.
M
Mallach, Sven
(2018)
Compact Linearization for Binary Quadratic Problems Comprising Linear Constraints.
Technical Report
, 16 p.
Mallach, Sven
(2018)
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.
Published in:
Journal of Discrete Algorithms.
S
Schmidt, Daniel R. and Zey, Bernd and Margot, François
(2018)
An Exact Algorithm for the Steiner Forest Problem.
Published In:
26th Annual European Symposium on Algorithms (ESA 2018), Leibniz International Proceedings in Informatics (LIPIcs). 112 Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 2018, 70:1-70:14.