TY - JOUR
T1 - Polynomial testing of the query "IS ab ≥ cd?" with application to finding a minimal cost reliability ratio spanning tree
AU - Chandrasekaran, R.
AU - Tamir, A.
PY - 1984/10
Y1 - 1984/10
N2 - Given integers a, b, c, d, we present a polynomial algorithm for the query "is ab ≥ cd?". The result is applied to yield a polynomial algorithm for the minimal cost reliability ratio spanning tree problem.
AB - Given integers a, b, c, d, we present a polynomial algorithm for the query "is ab ≥ cd?". The result is applied to yield a polynomial algorithm for the minimal cost reliability ratio spanning tree problem.
UR - http://www.scopus.com/inward/record.url?scp=0021510208&partnerID=8YFLogxK
U2 - 10.1016/0166-218X(84)90013-1
DO - 10.1016/0166-218X(84)90013-1
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0021510208
SN - 0166-218X
VL - 9
SP - 117
EP - 123
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 2
ER -