Interconnecting highways
| dc.citation.epage | 261 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 252 | en_US |
| dc.citation.volume | 12 | en_US |
| dc.citation.woscount | 3 | |
| dc.contributor.author | Du, DZ | en_US |
| dc.contributor.author | Hwang, FK | en_US |
| dc.contributor.author | Xue, GL | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:46:41Z | |
| dc.date.available | 2014-12-08T15:46:41Z | |
| dc.date.issued | 1999-04-29 | en_US |
| dc.description.abstract | We present the problem of constructing roads of minimum total length to interconnect n highways under the constraint that the roads can intersect each highway only at one point in a designated interval which is a line segment. We present a set of optimality conditions for the problem and show how to construct a solution to meet this set of optimality conditions. | en_US |
| dc.identifier.issn | 0895-4801 | en_US |
| dc.identifier.journal | SIAM JOURNAL ON DISCRETE MATHEMATICS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/31388 | |
| dc.identifier.wosnumber | WOS:000080071500007 | |
| dc.language.iso | en_US | en_US |
| dc.subject | interconnecting networks | en_US |
| dc.subject | optimality conditions | en_US |
| dc.subject | Steiner trees | en_US |
| dc.title | Interconnecting highways | en_US |
| dc.type | Article | en_US |