Zobrazeno 1 - 10
of 1 162
pro vyhledávání: '"Hamiltonian path problem"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Optimization Letters. 16:1215-1234
We consider a multiple-depots extension of the classic Hamiltonian path problem where k salesmen are initially located at different depots. To the best of our knowledge, no algorithm for this problem with a constant approximation ratio has been previ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fda3bd6f31761a6932ed79be22b845f8
https://doi.org/10.1007/s11590-021-01774-5
https://doi.org/10.1007/s11590-021-01774-5
Autor:
Stefan Lendl, Ante Ćustić
Publikováno v:
Journal of Combinatorial Optimization
The Steiner path problem is a common generalization of the Steiner tree and the Hamiltonian path problem, in which we have to decide if for a given graph there exists a path visiting a fixed set of terminals. In the Steiner cycle problem we look for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::babd80b80e3348f73b03f6f822fd025f
https://doi.org/10.1007/s10878-021-00757-7
https://doi.org/10.1007/s10878-021-00757-7
Autor:
Jingjing Ma
Publikováno v:
Journal of Nanoelectronics and Optoelectronics. 16:731-737
Self-assembly reveals the innate character of DNA computing, DNA self-assembly is regarded as the best way to make DNA computing transform into computer chip. This paper introduces a strategy of DNA 3D self-assembly algorithm to solve the Hamiltonian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58a47db88401434f7a1623a6a642e9ea
https://doi.org/10.1166/jno.2021.3000
https://doi.org/10.1166/jno.2021.3000
Autor:
Manojkumar Ramteke, Deepak Sharma
Publikováno v:
DNA-and RNA-Based Computing Systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bbb06506deee432c65d05e61c5eb2697
https://doi.org/10.1002/9783527825424.ch2
https://doi.org/10.1002/9783527825424.ch2
Publikováno v:
SIAM Journal on Computing. 50:1148-1153
This corrigendum corrects errors found by Jeremie Dusart in the proof of correctness of the algorithms in [D. G. Corneil, B. Dalton, and M. Habib, SIAM J. Comput., 42 (2013), pp. 792--807]; there a...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed91d62efa792c5ed18379f4590e00c2
https://doi.org/10.1137/20m1327835
https://doi.org/10.1137/20m1327835
Autor:
Ryuhei Uehara
Publikováno v:
Algorithms, Vol 6, Iss 1, Pp 60-83 (2013)
A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection. There are several natural gra
Externí odkaz:
https://doaj.org/article/5f26978fc989485eae64f68eb0c5b5d7
Autor:
Pablo Adasme, Ali Dehghan Firoozabadi
Publikováno v:
Complexity, Vol 2020 (2020)
Let G V , E be a simple undirected complete graph with vertex and edge sets V and E , respectively. In this paper, we consider the degree-constrained k -minimum spanning tree (DC k MST) problem which consists of finding a minimum cost subtree of G fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c8d19e60e601e6b209dcccefeb9a048
https://doi.org/10.1155/2020/7628105
https://doi.org/10.1155/2020/7628105