OpenAlex
PricingAboutJobs
Log inGet started
Work

An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs

HTML

Year: 1998
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Integer Programming and Combinatorial Optimization
DOI: 10.1007/3-540-69346-7_10
Authors: Joseph Cheriyan, András Sebő, Zoltán Szigeti
Institutions: University of Waterloo, Centre National de la Recherche Scientifique, Université Joseph Fourier, Université Pierre-et-Marie-Curie
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: approximation algorithms, approximation ratio, NP-hard problems, traveling salesman problem, undirected graphs, edge connectivity

Open Access status: closed
OpenAlex ID: W1605196620
FWCI: 3.101
Cites: 11
Cited by: 33
Related to: 7
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security