"An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via ..."

Yusuke Kobayashi, Takashi Noguchi (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2023.49

access: open

type: Conference or Workshop Paper

metadata version: 2023-11-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/0001N23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/0001N23
Yusuke Kobayashi, Takashi Noguchi:
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. ISAAC 2023: 49:1-49:10

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.