"Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial ..."

Mikhail Yu. Khachay, Katherine Neznakhina, Ksenia Rizhenko (2022)

> Home

Details and statistics

DOI: 10.1007/978-3-031-22543-7_6

access: closed

type: Conference or Workshop Paper

metadata version: 2023-01-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/optima/KhachayNR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/optima/KhachayNR22
Mikhail Yu. Khachay, Katherine Neznakhina, Ksenia Rizhenko:
Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio. OPTIMA 2022: 81-90

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.