Referenzen
| 74. |
An improved upper bound on the integrality ratio for the s-t-path TSP
Oper. Res. Lett.,
47(3):225--228
2019
|
| 73. |
Approaching $\frac {3}{2}$ for the s-t-path TSP
J. ACM,
66(2):Art. 14, 17
2019
DOI: 10.1145/3309715
|
| 72. |
Vehicle routing with subtours
Discrete Optim.,
33:87--100
2019
|
| 71. |
The asymmetric traveling salesman path LP has constant integrality ratio
Integer programming and combinatorial optimization Band 11480
aus Lecture Notes in Comput. Sci.
Seite 288--298.
Herausgeber: Springer, Cham,
2019
|
| 70. |
An Approximation Algorithm for Threshold Voltage Optimization
ACM Trans. Des. Autom. Electron. Syst.,
23(6):68:1--68:16
2018
ISSN: 1084-4309
DOI: 10.1145/3232538
|
| 69. |
Better s-t-tours by Gao trees
Math. Program.,
172(1-2, Ser. B):191--207
2018
|
| 68. |
Global Routing with Timing Constraints
IEEE Trans. on CAD of Integrated Circuits and Systems,
37:406--419
2018
|
| 67. |
Combinatorial optimization
Band 21
aus Algorithms and Combinatorics
Herausgeber: Springer, Berlin,
2018
ISBN: 978-3-662-56038-9; 978-3-662-56039-6
|
| 66. |
Beating the integrality ratio for s-t-tours in graphs
59th Annual IEEE Symposium on Foundations of Computer Science---FOCS 2018
Seite 766--777.
Herausgeber: IEEE Computer Soc., Los Alamitos, CA,
2018
|
| 65. |
Approaching 3/2 for the s-t-path TSP.
Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
, Seite 1854-1864.
2018
|
| 64. |
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Math. Program. Comput.,
9(2):135--202
2017
|
| 63. |
Few Sequence Pairs Suffice: Representing All Rectangle Placements
eprint arXiv,
1708.09779
2017
|