"Constant-Time Approximation Algorithms for the Optimum Branching Problem ..."

Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito (2012)

> Home

Details and statistics

DOI: 10.1109/ICNC.2012.78

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/ic-nc/KusumotoYI12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ic-nc/KusumotoYI12
Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito:
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. ICNC 2012: 407-413

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.