Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Olivier Goldschmidt"'
Publikováno v:
SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23) ISBN: 9781611977714
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91a8e8bb49a4bf834a96689d1fa9b28a
https://doi.org/10.1137/1.9781611977714.17
https://doi.org/10.1137/1.9781611977714.17
Publikováno v:
Proceedings of the 14th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98aeec224820d7e46862097824ac3fd1
https://doi.org/10.5220/0011405400003335
https://doi.org/10.5220/0011405400003335
Publikováno v:
Networks. 41:13-23
Motivated by a problem arising in the design of telecommunications networks using the SONET standard, we consider the problem of covering all edges of a graph using subgraphs that contain at most k edges with the objective of minimizing the total num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de0f725e55265c882f4eae1aaee3053e
https://doi.org/10.1002/net.10054
https://doi.org/10.1002/net.10054
Autor:
Dorit S. Hochbaum, Olivier Goldschmidt
Publikováno v:
Discrete Applied Mathematics. 74(2):159-169
We study here a problem on graphs that involves finding a subgraph of maximum node weights spanning up to k edges. We interpret the concept of “spanning” to mean that at least one endpoint of the edge is in the subgraph in which we seek to maximi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ee56d6fd9f0e5c90111d719aee2b616
Autor:
Gang Yu, Olivier Goldschmidt
Publikováno v:
Journal of Combinatorial Optimization. 1:151-164
Given a graph G = (V,E), we define the locally optimal independent sets asfollows. Let S be an independent set and T be a subset of V such that S ∩ T = ∅ and Γ(S) \( \subseteq \) T, where Γ(S) is defined as the neighbor set of S. A minimum domi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96ce954e61cbd3c773af358f1090944e
https://doi.org/10.1023/a:1009755815678
https://doi.org/10.1023/a:1009755815678
On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
Publikováno v:
European Journal of Operational Research. 94:97-105
The BSPS problem is to find a planar and biconnected spanning subgraph of a general graph. This problem is related to the planarization problem which seeks a planar spanning subgraph with a maximum number of edges. Like the planarization problem, BSP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc93502738b02cae9cd45903ae2d810a
https://doi.org/10.1016/0377-2217(95)00202-2
https://doi.org/10.1016/0377-2217(95)00202-2
Autor:
Gang Yu, Olivier Goldschmidt
Publikováno v:
Naval Research Logistics. 43:737-748
In this paper, we introduce a new notion of local optimality and demonstrate its application to the problem of finding optimal independent sets and vertex covers in k-claw free graphs. The maximum independent set problem in k-claw free graphs has int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7288d72a77296088eb76db728b9aa46c
https://doi.org/10.1002/(sici)1520-6750(199608)43:5<737::aid-nav9>3.0.co
https://doi.org/10.1002/(sici)1520-6750(199608)43:5<737::aid-nav9>3.0.co
Publikováno v:
Computers & Operations Research. 23:103-111
Randomized versions of Karmarkar and Karp's differencing method are introduced for the Number Partitioning problem. The development of these methods and a discussion of their merits are presented. It is shown that these randomized heuristics consiste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad77ec3c14827bf2168caf34c8f08e1f
https://doi.org/10.1016/0305-0548(95)e0020-l
https://doi.org/10.1016/0305-0548(95)e0020-l
Publikováno v:
Naval Research Logistics. 41:833-842
The 0-1 knapsack problem can be defined as follows. Given a set of items, select the subset with largest total value, subject to the constraint that the total weight of the items selected does not exceed a fixed capacity. The total value of a set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33cab33bf99690f21204eaa5c6b66dda
https://doi.org/10.1002/1520-6750(199410)41:6<833::aid-nav3220410611>3.0.co
https://doi.org/10.1002/1520-6750(199410)41:6<833::aid-nav3220410611>3.0.co
Autor:
Olivier Goldschmidt, Alexan Takvorian
Publikováno v:
Networks. 24:69-73
Given a graph G = (V, E), the graph planarization problem is to find a largest subset F of E, such that H = (V, F) is planar. It is known to be NP-complete. This problem is of interest in automatic graph drawing, in facilities layout, and in the desi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94134a743bd705fded76afbfd5166e7e
https://doi.org/10.1002/net.3230240203
https://doi.org/10.1002/net.3230240203