Brief announcement: Efficient approximation algorithms for computing k disjoint restricted shortest paths

Guo, L; Shen, H; Liao, K; Li, P

Brief announcement: Efficient approximation algorithms for computing k disjoint restricted shortest paths

conference contribution

posted on 2025-02-04, 02:10 authored by L Guo, H Shen, K Liao, P Li

Brief announcement: Efficient approximation algorithms for computing k disjoint restricted shortest paths

History

Volume

2015-June

Pagination

62-64

Location

Portland, Oregon, USA

Open access

No

Start date

2015-06-13

End date

2015-06-15

Language

eng

Title of proceedings

SPAA '15: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures

Event

Parallelism in Algorithms and Architectures. Symposium (2015 : 27th : Portland, Oregon, USA)

Publisher

Association for Computing Machinery

Place of publication

New York, N.Y.

Publication URL

https://doi.org/10.1145/2755573.2755608

Usage metrics

Keywords

Uncategorised value

Brief announcement: Efficient approximation algorithms for computing k disjoint restricted shortest paths

History

Volume

Pagination

Location

Open access

Start date

End date

Language

Title of proceedings

Event

Publisher

Place of publication

Publication URL

Usage metrics

Categories

Keywords

Licence

Exports