The k-path tree matroid and its applications to survivable network design

Esther M. Arkin, Refael Hassin

Research output: Contribution to journalArticlepeer-review

Abstract

We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs. We solve the problems for undirected and directed graphs. We then use these exact algorithms to give improved approximation algorithms for problems in which the weights satisfy the triangle inequality and the connectivity requirement is either 2 among at most five nodes and 1 for the other nodes, or it is 3 among a set of three nodes and 1 for all other nodes.

Original languageEnglish
Pages (from-to)314-322
Number of pages9
JournalDiscrete Optimization
Volume5
Issue number2
DOIs
StatePublished - May 2008

Keywords

  • Algorithm
  • Matroid intersection
  • Network connectivity

Fingerprint

Dive into the research topics of 'The k-path tree matroid and its applications to survivable network design'. Together they form a unique fingerprint.

Cite this