"Efficient algorithms for the minmax regret path center problem with length ..."

Biing-Feng Wang (2022)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2022.03.017

access: closed

type: Journal Article

metadata version: 2022-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/Wang22a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Wang22a
Biing-Feng Wang:
Efficient algorithms for the minmax regret path center problem with length constraint on trees. Theor. Comput. Sci. 918: 18-31 (2022)

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.