Efficient algorithms for some path partitioning problems

DOI10.1016/0166-218X(94)00146-5zbMath0838.90101MaRDI QIDQ1900138

Peter Brucker

Publication date: 22 November 1995

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

zbMATH Keywords

clusteringimage processingone-machine batching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• The complexity of one-machine batching problems
• Most uniform path partitioning and its use in image processing
• Sequence comparison with mixed convex and concave costs

This page was built for publication: Efficient algorithms for some path partitioning problems