"An LP-based 32-approximation algorithm for the s-ts-t path ..."

Zhihan Gao (2013)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2013.08.006

access: closed

type: Journal Article

metadata version: 2022-11-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Gao13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Gao13
Zhihan Gao:
An LP-based 32-approximation algorithm for the s-ts-t path graph Traveling Salesman Problem. Oper. Res. Lett. 41(6): 615-617 (2013)

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.