Two disjoint shortest paths problem with non-negative edge length
Year of publication: |
2019
|
---|---|
Authors: | Kobayashi, Yusuke ; Sako, Ryo |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 1, p. 66-69
|
Subject: | Disjoint paths | Shortest path | Polynomial-time algorithm | Theorie | Theory | Algorithmus | Algorithm |
-
Scheduling unrelated machines with two types of jobs
Vakhania, Nodari, (2014)
-
Algorithms for the joint multitasking scheduling and common due date assignment problem
Liu, Ming, (2017)
-
Charkhgard, Hadi, (2018)
- More ...
-
The complexity of minimizing the difference of two M⇋-convex set functions
Kobayashi, Yusuke, (2015)
-
Otsuki, Kensuke, (2016)
-
Tight approximation for unconstrained XOS maximization
Filmus, Yuval, (2021)
- More ...