Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Hardness, approximability, and fixed-parameter tractability of the ..."

Mattia D'Emidio et al. (2019)

> Home

Details and statistics

DOI: 10.1007/S10878-018-00374-X

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/DEmidioFFLP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/DEmidioFFLP19
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. 38(1): 165-184 (2019)

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.