"Efficient Approximation Algorithms for Computing k-Disjoint Minimum Cost ..."

Longkun Guo, Hong Shen (2012)

> Home

Details and statistics

DOI: 10.1109/PDCAT.2012.69

access: closed

type: Conference or Workshop Paper

metadata version: 2018-06-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/pdcat/GuoS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pdcat/GuoS12
Longkun Guo, Hong Shen:
Efficient Approximation Algorithms for Computing k-Disjoint Minimum Cost Paths with Delay Constraint. PDCAT 2012: 627-631

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.