Zobrazeno 1 - 10
of 57
pro vyhledávání: '"S. Salowe"'
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.
Autor:
Jeffrey S. Salowe, Dana Richards
Publikováno v:
International Journal of Computational Geometry & Applications. :277-292
A mixed spanning tree is a tree that seeks to combine the properties of a minimim weight spanning tree and shortest path tree. We concentrate on the problem for complete Euclidean graphs. A survey of prior algorithms is given and several new algorith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c78d6ab136ef99757fa1ca853d00fd3
https://doi.org/10.1142/s0218195999000194
https://doi.org/10.1142/s0218195999000194
Autor:
Jeffrey S. Salowe, Joseph L. Ganley
Publikováno v:
Operations Research Letters. 19:217-224
Given a set of terminals in the plane, a bottleneck Steiner tree is a tree interconnecting the terminals, in which the length of the longest edge is minimized. The bottleneck Steiner tree problem, or special cases thereof, has applications in facilit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a28e8d01aeb926344d1cf46e6c7febf
https://doi.org/10.1016/s0167-6377(96)00028-4
https://doi.org/10.1016/s0167-6377(96)00028-4
Autor:
Gabriel Robins, Jeffrey S. Salowe
Publikováno v:
Discrete & Computational Geometry. 14:151-165
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum spanning tree (MST). We prove that, under theLp norm, the maximum vertex degree over all MSTs is equal to the Hadwiger number of the corresponding unit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4225bdd1f95c83dbf2f0adee3efc6df
https://doi.org/10.1007/bf02570700
https://doi.org/10.1007/bf02570700
Autor:
Jeffrey S. Salowe, David M. Warme
Publikováno v:
Networks. 25:69-87
Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for any
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e8b3a11e85f15010922173b6c559fba
https://doi.org/10.1002/net.3230250206
https://doi.org/10.1002/net.3230250206
Autor:
J. M. Bollinger, S. Salowe, M. C. Samano, John McCracken, Mark A. Ator, JoAnne Stubbe, Morris J. Robins, Jack Peisach
Publikováno v:
Biochemistry. 32:12749-12760
Ribonucleotide reductase (RDPR) from Escherichia coli is composed of two subunits, R1 and R2, and catalyzes the conversion of nucleotides to deoxynucleotides. The mechanism of inactivation of RDPR by 2'-azido-2'-deoxynucleoside 5'-diphosphate (N3UDP)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b73677ab6bf43594f09382c271b7acef
https://doi.org/10.1021/bi00210a026
https://doi.org/10.1021/bi00210a026
Autor:
Jeffrey S. Salowe
Publikováno v:
Operations Research Letters. 12:271-274
The rectilinear Steiner ratio is the worst-case ratio of the length of a rectilinear minimum spanning tree to the length of a minimal tree. Hwang proved that the ratio for point sets in the plane is 3/2. We provide a simple proof of the 3/2-bound.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0af40803c7d632810ab35db9ee65b3a3
https://doi.org/10.1016/0167-6377(92)90053-6
https://doi.org/10.1016/0167-6377(92)90053-6
Autor:
J. S. Salowe, Dana Richards
Publikováno v:
Algorithmica. 7:247-276
Ak-extremal point set is a point set on the boundary of ak-sided rectilinear convex hull. Given ak-extremal point set of sizen, we present an algorithm that computes a rectilinear Steiner minimal tree in timeO(k 4 n). For constantk, this algorithm ru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b5c52b710f2d4a278390df29ed4b10e
https://doi.org/10.1007/bf01758761
https://doi.org/10.1007/bf01758761
Autor:
Dana Richards, Jeffrey S. Salowe
Publikováno v:
Acta Informatica. 29:395-414
Anorder-statistic deque is a deque that also supports the operationfind(k, D), wherefind(k, D) returns the item inD with rankk. Assumingk is fixed, we show how to implement an order-statistic deque so thatinject(x, D), eject(D), push(x, D), andpop(D)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b88c3c4423f4083dcffd731a54a927d3
https://doi.org/10.1007/bf01193574
https://doi.org/10.1007/bf01193574
Autor:
Jeffrey S. Salowe
Publikováno v:
International Journal of Computational Geometry & Applications. :49-59
In this paper, we study the enumerative versions of the interdistance in terdis stance ranking and selection problems in space, namely, the fixed-radius near neighbors and interdistance enumeration problems, respectively. The input to the fixed-radiu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::745a6852ead34657124627dc28711dc2
https://doi.org/10.1142/s0218195992000044
https://doi.org/10.1142/s0218195992000044