"Efficient Approximations for Thinnest Path Problem in Grid Graph."

Shuang Wu et al. (2018)

> Home

Details and statistics

DOI: 10.1145/3164541.3164567

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icuimc/WuCWGWC18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icuimc/WuCWGWC18
Shuang Wu, Zhiyin Chen, Yang Wang, Xiaofeng Gao, Fan Wu, Guihai Chen:
Efficient Approximations for Thinnest Path Problem in Grid Graph. IMCOM 2018: 33:1-33:8

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.