Efficient algorithms for some path partitioning problems

DOI10.1016/0166-218X(94)00146-5zbMATH Open0838.90101MaRDI QIDQ1900138FDOQ1900138

Authors: Peter Brucker 

Publication date: 22 November 1995

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

Recommendations

• A New Polynomially Bounded Shortest Path Algorithm
• An Appraisal of Some Shortest-Path Algorithms
• Improved algorithms for path partition and related problems
• Efficient points on a network
• On the minimax path in a network

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

• Most uniform path partitioning and its use in image processing
• The complexity of one-machine batching problems
• Batch sizing and job sequencing on a single machine
• Title not available (Why is that?)
• Sequence comparison with mixed convex and concave costs

Cited In (9)

• Title not available (Why is that?)
• Improved algorithms for path partition and related problems
• Title not available (Why is that?)
• Minimum \(L_k\) path partitioning-an illustration of the Monge property
• A fast randomized algorithm for partitioning a graph into paths of fixed length
• Path partitions and forward-only trellis algorithms
• A note on the partitioning shortest path algorithm
• Most uniform path partitioning and its use in image processing
• Path optimization for graph partitioning problems

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

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