The (K, k)-capacitated spanning tree problem

Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that the problem can be approximated within a constant factor, and present better approximations when k is 1 or 2.

Original languageEnglish
Title of host publicationAlgorithmic Aspects in Information and Management - 6th International Conference, AAIM 2010, Proceedings
Pages25-34
Number of pages10
DOIs
StatePublished - 2010
Event6th International Conference on Algorithmic Aspects in Information and Management, AAIM 2010 - Weihai, China
Duration: 19 Jul 201021 Jul 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6124 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Algorithmic Aspects in Information and Management, AAIM 2010
Country/TerritoryChina
CityWeihai
Period19/07/1021/07/10

Funding

FundersFunder number
National Science FoundationCCF-0729019

    Fingerprint

    Dive into the research topics of 'The (K, k)-capacitated spanning tree problem'. Together they form a unique fingerprint.

    Cite this