Approximation algorithms and complexity results for path problems in trees of rings

Metadata Label Value
Author(s): Erlebach, Thomas
Publisher: Eidgenössische Technische Hochschule Zürich (ETH), Institut für Technische Informatik und Kommunikationsnetze (TIK)
Citation:

Erlebach, Thomas. Approximation algorithms and complexity results for path problems in trees of rings. Eidgenössische Technische Hochschule Zürich (ETH), Institut für Technische Informatik und Kommunikationsnetze (TIK) (2001). http://dx.doi.org/10.3929/ethz-a-004256657

Document Type: Reports  
Documents: Text (158.63KB)

Detailed Information

Metadata Description
Title Approximation algorithms and complexity results for path problems in trees of rings
Author(s) Erlebach, Thomas
Publication Place Zürich
Publisher Eidgenössische Technische Hochschule Zürich (ETH), Institut für Technische Informatik und Kommunikationsnetze (TIK)
Publication Date 2001
Series TIK-Report Nr. 109
Language English
DOI http://dx.doi.org/10.3929/ethz-a-004256657
Subject(s) Computer Systems
Telecommunications
Keyword(s) DATA COMMUNICATIONS
COMPUTER SYSTEMS
NETWORK TOPOLOGY
ELECTRICAL ENGINEERING
Organisational Unit Computer Engineering and Networks Laboratory
Online Publication Date 2002
Description File Name MIME Type Size
Text   eth-24442-01.pdf application/pdf 158.63KB
Abstract Views and Downloads
Views 20  abstracts
Downloads 36  downloads

Abstract Views and Downloads by Country
United States Views abstracts
Downloads downloads
China Views abstracts
Downloads downloads
Views abstracts
Downloads downloads
Germany Views abstracts
Downloads downloads
France Views abstracts
Downloads downloads
Greece Views abstracts
Downloads downloads
Switzerland Views abstracts
Downloads downloads
Canada Views abstracts
Downloads downloads
India Views abstracts
Downloads downloads
Italy Views abstracts
Downloads downloads
Vietnam Views abstracts
Downloads downloads
Korea, Republic of Views abstracts
Downloads downloads


E-Collection record created: Fri, 18 Apr 2008, 23:10:18 CET