Skip to main content

A linear time 53-approximation for the minimum strongly-connected spanning subgraph problem

Download / Buy Article:

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Keywords: Approximation algorithms; Cycle contraction; Strongly connected subgraph

Document Type: Short Communication

DOI: http://dx.doi.org/10.1016/S0020-0190(02)00476-3

Affiliations: Department of Information Science, Faculty of Engineering, Utsunomiya University, , 321-8585, Utsunomiya, Japan

Publication date: April 30, 2003

els/00200190/2003/00000086/00000002/art00476
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more