"The Parameterized Hardness of the k-Center Problem in Transportation Networks."

Andreas Emil Feldmann, Dániel Marx (2020)

> Home

Details and statistics

DOI: 10.1007/S00453-020-00683-W

access: closed

type: Journal Article

metadata version: 2020-06-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/FeldmannM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/FeldmannM20
Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica 82(7): 1989-2005 (2020)

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.