A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning 
subgraph

Auletta, Vincenzo; Dinitz, Yefim; Nutov, Zeev; Parente, Domenico

Local TagsRelease HistoryDetailsSummary

A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph

Auletta, V., Dinitz, Y., Nutov, Z., & Parente, D. (1999). A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. Journal of Algorithms, 32(1), 21-30.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3583-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3584-2

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Auletta, Vincenzo, Author
Dinitz, Yefim¹, Author
Nutov, Zeev¹, Author
Parente, Domenico, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1999

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 518068
Other: Local-ID: C1256428004B93B8-D452427BCF66F458C12568B20045B2D0-AulettaDinitzNutuvDomenico1999

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Algorithms

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 32 (1) Sequence Number: - Start / End Page: 21 - 30 Identifier: -