Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jeroen H. G. C. Rutten"'
Autor:
Maarten Boogaarts, Young-Jun Kim, Khalid Elbattay, Balaji Rangarajan, Marcel Bontekoe, Andrew Moe, Young Seog Kang, Tony Park, Chung-Yong Kim, Dong Kyung Han, Axel von Sydow, Jeong Heung Kong, Jan-Pieter van Delft, Arjan Donkerbroek, Se Yeon Jang, Jeroen Cottaar, Ruiyue Ouyang, Jin Phil Choi, Jeroen H. G. C. Rutten
Publikováno v:
SPIE Proceedings.
The next generation technology and emerging memory devices require gradually tighter lithographic focus control on imaging critical layers. Especially in case of BEOL process, big PDO (Process Dependent Offset) from large intra-field topography steps
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9be892ab69028b9f590a95af3bf0b343
https://doi.org/10.1117/12.2258184
https://doi.org/10.1117/12.2258184
Publikováno v:
Statistica Neerlandica. 61:35-60
In this paper, we consider the problem of disconnecting a graph by removing as few vertices as possible, such that no component of the disconnected graph has more than a given number of vertices. We give applications of this problem, present a formul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e32f7ee1a7af3089c94390dfdd8b4dd9
https://doi.org/10.1111/j.1467-9574.2007.00350.x
https://doi.org/10.1111/j.1467-9574.2007.00350.x
Publikováno v:
Networks. 38:209-226
The clique partitioning problem (CPP) can be formulated as follows: Given is a complete graph G = (V, E), with edge weights wij ∈ ℝ for all {i, j} ∈ E. A subset A ⊆ E is called a clique partition if there is a partition of V into nonempty, di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4499a8e0347d76c650b2b3d95e481d31
https://doi.org/10.1002/net.10004
https://doi.org/10.1002/net.10004
Publikováno v:
ResearcherID
Operations Research Letters, 24(5), 235-243. Elsevier Science
Operations Research Letters, 24(5), 235-243. Elsevier Science
In this paper we prove two lifting theorems for the clique partitioning polytope, which provide sufficient conditions for a valid inequality to be facet-defining. In particular, if a valid inequality defines a facet of the polytope corresponding to t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab85c047a2456a82c636464dd6f39e78
https://doi.org/10.1016/s0167-6377(99)00029-2
https://doi.org/10.1016/s0167-6377(99)00029-2
Publikováno v:
Operations Research Proceedings ISBN: 9783540608066
The clique partitioning problem can be described as follows. Given a complete graph G = (V, E) with edge weights w e ∈ IR for all e ∈ E, find a subset A ⊆ E such that the graph G′ = (V, A) consists of cliques, and such that 1 is minimal. Obvi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fe871faed3ec692c9a879ca652fd368
https://doi.org/10.1007/978-3-642-80117-4_13
https://doi.org/10.1007/978-3-642-80117-4_13
