Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14372
For citation please use:
Main Title: Reducing the Optimality Gap of Strictly Fundamental Cycle Bases in Planar Grids
Author(s): Köhler, Ekkehard
Liebchen, Christian
Rizzi, Romeo
Wünsch, Gregor
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15599
http://dx.doi.org/10.14279/depositonce-14372
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: The Minimum Cycle Basis~(MCB) Problem is a classical problem in combinatorial optimization. This problem can be solved in O(m2n+mn2log(n)). Much faster heuristics have been examined in the context of several practical applications. These heuristics restrain the solution space to strictly fundamental cycle bases, hereby facing a significant loss in quality. We complement these experimental studies by explaining theoretically why strictly fundamental cycle bases~(SFCB) in general must be much worse than general MCB.
Subject(s): combinatorial optimization
cycle bases
strictly fundamental cycle bases
approximation
average stretch
Issue Date: 2006
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
68R05 Combinatorics
05C05 Trees
05C38 Paths and cycles
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2006, 07
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-007-2006.pdf
Format: Adobe PDF | Size: 253.37 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.