Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito (2013)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition @ ijnc.org (open access)
- export record
  dblp key:
  - journals/ijnc/KusumotoYI13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijnc/KusumotoYI13
Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito:
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. Int. J. Netw. Comput. 3(2): 205-216 (2013)

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.