Referenzen
52. |
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Mathematical Programming Computation,
9(2):135--202
2017
|
51. |
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Math. Program. Comput.,
9(2):135--202
2017
|
50. |
Automatic Cell Layout in the 7nm Era
ISPD '17 Proceedings of the 2017 ACM International Symposium on PhysicalDesign
, Seite 99--106.
2017
|
49. |
An exact algorithm for wirelength optimal placements in VLSI design
Integration, the VLSI Journal,
52:355--366
2016
|
48. |
Algorithmic mathematics
Herausgeber: Springer, Cham,
2016
ISBN: 978-3-319-39557-9; 978-3-319-39558-6
|
47. |
On the nearest neighbor rule for the metric traveling salesman problem
Discrete Appl. Math.,
195:101--103
2015
|
46. |
The approximation ratio of the greedy algorithm for the metric traveling salesman problem
Oper. Res. Lett.,
43(3):259--261
2015
|
45. |
Algorithmische Mathematik
Herausgeber: Springer,
2015
|
44. |
Chip Design
In
, Editor,
The Princeton Companion to Applied Mathematics
Seite 804--807.
Herausgeber: Princeton University Press,
2015
|
43. |
On the integrality ratio of the subtour LP for Euclidean TSP
Oper. Res. Lett.,
42(8):495--499
2014
|
42. |
Edge elimination in TSP instances
Graph-theoretic concepts in computer science Band 8747
aus Lecture Notes in Comput. Sci.
Seite 275--286.
Herausgeber: Springer, Cham,
2014
|
41. |
BonnCell: Automatic Layout of Leaf Cells
Proceedings of the 18th Asia and South Pacific Design AutomationConference (ASPDAC) 2013
, Seite 453--460.
2013
|