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

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.


Download / Buy Article:

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

Related content



Share Content

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
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