"Efficient algorithms for delay-bounded minimum cost path problem in ..."

Girish Kumar, Nishit Narang, C. P. Ravikumar (1998)

> Home

Details and statistics

DOI: 10.1109/HIPC.1998.737982

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/hipc/KumarNR98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hipc/KumarNR98
Girish Kumar, Nishit Narang, C. P. Ravikumar:
Efficient algorithms for delay-bounded minimum cost path problem in communication networks. HiPC 1998: 141-146

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.