"On the Complexity of Computing Optimal Private Park-and-Ride Plans."

Martin Olsen (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-41019-2_6

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iccl2/Olsen13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccl2/Olsen13
Martin Olsen:
On the Complexity of Computing Optimal Private Park-and-Ride Plans. ICCL 2013: 73-82

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.