Login / Signup

Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces.

Junran LichenJianping LiKo-Wei Lih
Published in: Inf. Process. Lett. (2018)
Keyphrases
  • approximation algorithms
  • constant factor
  • np hard
  • minimum cost
  • special case
  • worst case
  • undirected graph
  • total length
  • objective function
  • constant factor approximation