Interconnecting highways

Ding Zhu Du; Frank K. Hwang; Guoliang Xue

doi:10.1137/S089548019732653X

Interconnecting highways

Ding Zhu Du, Frank K. Hwang, Guoliang Xue

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English (US)
Pages (from-to)	252-261
Number of pages	10
Journal	SIAM Journal on Discrete Mathematics
Volume	12
Issue number	2
DOIs	https://doi.org/10.1137/S089548019732653X
State	Published - 1999
Externally published	Yes

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1137/S089548019732653X

Cite this

@article{fd9be14bda034f8388c99e5fc0cea873,

title = "Interconnecting highways",

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.",

author = "Du, {Ding Zhu} and Hwang, {Frank K.} and Guoliang Xue",

year = "1999",

doi = "10.1137/S089548019732653X",

language = "English (US)",

volume = "12",

pages = "252--261",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - Interconnecting highways

AU - Du, Ding Zhu

AU - Hwang, Frank K.

AU - Xue, Guoliang

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032623458&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032623458&partnerID=8YFLogxK

U2 - 10.1137/S089548019732653X

DO - 10.1137/S089548019732653X

M3 - Article

SN - 0895-4801

VL - 12

SP - 252

EP - 261

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 2

ER -

Interconnecting highways

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this