Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Approximation Algorithms for the Minimum Cardinality Two-Connected ..."

Prabhakar Gubbala, Balaji Raghavachari (2005)

> Home

Details and statistics

DOI: 10.1007/11496915_31

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ipco/GubbalaR05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/GubbalaR05
Prabhakar Gubbala, Balaji Raghavachari:
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. IPCO 2005: 422-436

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.