Two-connected Steiner networks: structural properties

Pawel Winter; Martin Zachariasen

Two-connected Steiner networks: structural properties

Pawel Winter, Martin Zachariasen

Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

Abstract

We give a number of structural results for the problem of constructing a minimum-length 2-connected network for a set of terminals in a graph, where edge-weights satisfy the triangle inequality. A new algorithmic framework, based on our structural results, is given.

Originalsprog	Engelsk
Tidsskrift	Operations Research Letters
Vol/bind	33
Sider (fra-til)	395-402
ISSN	0167-6377
Status	Udgivet - 2005
Udgivet eksternt	Ja

Emneord

Survivable networks
2-connected Steiner networks

Citationsformater

@article{5246d22db19d4cadb57218bea916baa2,

title = "Two-connected Steiner networks: structural properties",

abstract = "We give a number of structural results for the problem of constructing a minimum-length 2-connected network for a set of terminals in a graph, where edge-weights satisfy the triangle inequality. A new algorithmic framework, based on our structural results, is given.",

keywords = "Survivable networks, 2-connected Steiner networks, Survivable networks, 2-connected Steiner networks",

author = "Pawel Winter and Martin Zachariasen",

year = "2005",

language = "English",

volume = "33",

pages = "395--402",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

}

TY - JOUR

T1 - Two-connected Steiner networks: structural properties

AU - Winter, Pawel

AU - Zachariasen, Martin

PY - 2005

Y1 - 2005

N2 - We give a number of structural results for the problem of constructing a minimum-length 2-connected network for a set of terminals in a graph, where edge-weights satisfy the triangle inequality. A new algorithmic framework, based on our structural results, is given.

AB - We give a number of structural results for the problem of constructing a minimum-length 2-connected network for a set of terminals in a graph, where edge-weights satisfy the triangle inequality. A new algorithmic framework, based on our structural results, is given.

KW - Survivable networks

KW - 2-connected Steiner networks

KW - Survivable networks

KW - 2-connected Steiner networks

M3 - Journal article

SN - 0167-6377

VL - 33

SP - 395

EP - 402

JO - Operations Research Letters

JF - Operations Research Letters

ER -

Two-connected Steiner networks: structural properties

Abstract

Emneord

Fingeraftryk

Citationsformater