scientific article; zbMATH DE number 3950169

MaRDI QIDQ3720261zbMATH OpenFDO

Authors S. L. Kuzmin

Publication date 1985

zbMATH Keywords

flow problems on graphsNP-completenesspath length constraintspolynomial solvability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Recommendations

• Length-bounded cuts and flows
• Algorithms and complexity analysis for some flow problems
• scientific article; zbMATH DE number 1062936
• Flows with unit path capacities and related packing and covering problems
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation

Cited in

(12)

• Flows with unit path capacities and related packing and covering problems
• On the computational complexity of length- and neighborhood-constrained path problems
• Complexity and approximability of the maximum flow problem with minimum quantities
• Complexity of a classical flow restoration problem
• On the complexity of the Eulerian closed walk with precedence path constraints problem
• Integral flow decomposition with minimum longest path length
• Capacitated Confluent Flows: Complexity and Algorithms
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• On the complexity of the Eulerian closed walk with precedence path constraints problem
• scientific article; zbMATH DE number 1418332 (Why is no real title available?)
• Flows on few paths: Algorithms and lower bounds
• Flows with Unit Path Capacities and Related Packing and Covering Problems

This page was built for publication:

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