Edge disjoint Polyp Packing

DOI10.1016/S0166-218X(97)00025-5zbMath0890.68072OpenAlexW2163549008MaRDI QIDQ1377661

Gyula Y. Katona

Publication date: 11 June 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

\(p\)-polypBin Packing problemPolyp Packing problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

New models of graph-bin packing

Cites Work

• Bin packing can be solved within 1+epsilon in linear time
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Matching, Euler tours and the Chinese postman

This page was built for publication: Edge disjoint Polyp Packing