Approximation algorithms for constructing required subgraphs using stock pieces of fixed length.
Junran LichenJianping LiKo-Wei LihXingxing YuPublished in: J. Comb. Optim. (2022)
Keyphrases
- approximation algorithms
- fixed length
- variable length
- np hard
- special case
- feature vectors
- vertex cover
- worst case
- minimum cost
- sequential data
- primal dual
- open shop
- precedence constraints
- set cover
- bitstream
- randomized algorithms
- approximation schemes
- optimal solution
- constant factor
- combinatorial auctions
- n gram
- information extraction
- approximation ratio
- image sequences
- disjoint paths