On approximations for constructing required subgraphs using stock pieces of fixed length

DOI10.1007/978-3-030-27195-4_18OpenAlexW2965147015MaRDI QIDQ6199015

Junran Lichen, Xingxing Yu, Ko-Wei Lih, Jianping Li

Publication date: 23 February 2024

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-27195-4_18

zbMATH Keywords

approximation algorithmsbin packingAFPTASsubgraph constructionsstock pieces of fixed length \(L\)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

This page was built for publication: On approximations for constructing required subgraphs using stock pieces of fixed length