"Approximation Complexity of min-max (Regret) Versions of Shortest Path, ..."

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten (2005)

> Home

Details and statistics

DOI: 10.1007/11561071_76

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/esa/AissiBV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/AissiBV05
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA 2005: 862-873

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.