Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Algorithms to solve the knapsack constrained maximum spanning tree problem."

Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka (2005)

> Home

Details and statistics

DOI: 10.1080/00207160412331290667

access: closed

type: Journal Article

metadata version: 2024-02-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcm/YamadaWK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcm/YamadaWK05
Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka:
Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. J. Comput. Math. 82(1): 23-34 (2005)

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.