"On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in ..."

Hans-Joachim Böckenhauer et al. (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-36206-1_7

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fsttcs/BockenhauerBHKPSU02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/BockenhauerBHKPSU02
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS 2002: 59-70

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.