"Approximation Algorithms for LCS and LIS with Truly Improved Running Times."

Aviad Rubinstein et al. (2019)

> Home

Details and statistics

DOI: 10.1109/FOCS.2019.00071

access: closed

type: Conference or Workshop Paper

metadata version: 2020-12-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/RubinsteinSSS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/RubinsteinSSS19
Aviad Rubinstein, Saeed Seddighin, Zhao Song, Xiaorui Sun:
Approximation Algorithms for LCS and LIS with Truly Improved Running Times. FOCS 2019: 1121-1145

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.