Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP 
and Path Problems

Csaba, Bela; Krysta, Piotr; Karpinski, Marek

Local TagsRelease HistoryDetailsSummary

Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems

Csaba, B., Krysta, P., & Karpinski, M. (2002). Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02) (pp. 74-83). New York, USA: ACM.

Item is Released

show all hide all

Basic

show hide

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

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Csaba, Bela¹, Author
Krysta, Piotr¹, Author
Karpinski, Marek, Author

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

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2003-08-27Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 202079
Other: Local-ID: C1256428004B93B8-08AE5D9C120A99B2C1256C6F00588047-Krysta2002a

Degree: -

Event

show

hide

Title: SODA 2002

Place of Event: San Francisco, CA, USA

Start-/End Date: 2002-01-06 - 2002-01-08

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, USA : ACM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 74 - 83 Identifier: -