Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Stefan Hougardy"'
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39:2872-2885
Multipatterning technology used in 7-nm technology and beyond imposes more and more complex design rules on the layout of cells. The often nonlocal nature of these new design rules is a great challenge not only for human designers but also for existi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3410ad89dbe13f90d6f6fc3b1f7158d9
https://doi.org/10.1109/tcad.2019.2962782
https://doi.org/10.1109/tcad.2019.2962782
Publikováno v:
Operations Research Letters. 48:401-404
The 2-Opt heuristic is one of the simplest algorithms for finding good solutions to the metric Traveling Salesman Problem. It is the key ingredient to the well-known Lin–Kernighan algorithm and often used in practice. So far, only upper and lower b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da4bcc2656bbe7407ca0b38c3d8049fb
https://doi.org/10.1016/j.orl.2020.05.007
https://doi.org/10.1016/j.orl.2020.05.007
Publikováno v:
ISPD
In Placement Legalization, it is often assumed that (almost) all standard cells possess the same height and can therefore be aligned in cell rows, which can then be treated independently. However, this is no longer true for recent technologies, where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e86a00b9267bb1f4e699192d87a8618e
Publikováno v:
Integration. 52:355-366
We present a new algorithm designed to solve floorplanning problems optimally. More precisely, the algorithm finds solutions to rectangle packing problems which globally minimize wirelength and avoid given sets of blocked regions. We present the firs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c63a6aa736a86f089ad434a681b63c2b
https://doi.org/10.1016/j.vlsi.2015.07.001
https://doi.org/10.1016/j.vlsi.2015.07.001
Autor:
Xianghui Zhong, Stefan Hougardy
The well known 4/3 conjecture states that the integrality ratio of the subtour LP is at most 4/3 for metric Traveling Salesman instances. We present a family of Euclidean Traveling Salesman instances for which we prove that the integrality ratio of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26964c5ed57556bdce9f47b4c3eda87b
http://arxiv.org/abs/1808.02859
http://arxiv.org/abs/1808.02859
Autor:
Stefan Hougardy, Jens Vygen
Publikováno v:
Algorithmische Mathematik ISBN: 9783662574607
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc09455f1d487a6eb25aa21091a99e76
https://doi.org/10.1007/978-3-662-57461-4_11
https://doi.org/10.1007/978-3-662-57461-4_11
Autor:
Stefan Hougardy, Jens Vygen
Publikováno v:
Algorithmische Mathematik ISBN: 9783662574607
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b34c1ed6663183bd2c773c39dae0b409
https://doi.org/10.1007/978-3-662-57461-4_8
https://doi.org/10.1007/978-3-662-57461-4_8
Autor:
Stefan Hougardy, Jens Vygen
Publikováno v:
Algorithmische Mathematik ISBN: 9783662574607
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82ce1c45562b3ec734d9a3967a69debb
https://doi.org/10.1007/978-3-662-57461-4_6
https://doi.org/10.1007/978-3-662-57461-4_6
Autor:
Jens Vygen, Stefan Hougardy
Publikováno v:
Algorithmische Mathematik ISBN: 9783662574607
Algorithmische Mathematik ISBN: 9783662470138
Algorithmische Mathematik ISBN: 9783662470138
In diesem Kapitel wollen wir zwei weitere grundlegende kombinatorische Optimierungsprobleme losen: maximale Matchings in bipartiten Graphen und maximale Flusse in Netzwerken. Es wird sich herausstellen, dass das erste Problem ein Spezialfall des zwei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd41e9e4308938d3c4cc3f54a04f9fa4
https://doi.org/10.1007/978-3-662-57461-4_10
https://doi.org/10.1007/978-3-662-57461-4_10
Autor:
Stefan Hougardy, Jens Vygen
Publikováno v:
Algorithmische Mathematik ISBN: 9783662574607
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c05fff51f0667332faa9f5abfd0bd2b4
https://doi.org/10.1007/978-3-662-57461-4_1
https://doi.org/10.1007/978-3-662-57461-4_1