Approximation Algorithms for the Longest Run Subsequence Problem.
Yuichi AsahiroHiroshi EtoMingyang GongJesper JanssonGuohui LinEiji MiyanoHirotaka OnoShunichi TanakaPublished in: CPM (2023)
Keyphrases
- approximation algorithms
- np hard
- longest common subsequence
- special case
- minimum cost
- network design problem
- approximation ratio
- vertex cover
- primal dual
- worst case
- open shop
- facility location problem
- exact algorithms
- set cover
- disjoint paths
- constant factor approximation
- randomized algorithms
- np hardness
- precedence constraints
- undirected graph
- constant factor
- approximation guarantees
- upper bound
- approximation schemes
- combinatorial auctions
- greedy algorithm
- optimization problems
- constraint satisfaction problems