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

DOI10.1007/978-3-030-27195-4_18MaRDI QIDQ6199015zbMATH OpenOpenAlexFDO

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

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

AFPTASapproximation algorithmsbin packingstock pieces of fixed length \(L\)subgraph constructions

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
• Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces
• Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
• Approximations for constructing tree-form structures using specific material with fixed length

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199015)