Engineering Papers⌕ Search

Engineering topics

Schulz, A S

Publications and source records attributed to Schulz, A S.

Integer Equal Flows

The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R{sub 1}, ..., R{sub {ell}} must carry equal flow. We show this problem is effectively inapproximable, even if the cardinality of each set R{sub k} is two. When {ell} is fixed, it is solvable in polynomial time.

99 GENERAL AND MISCELLANEOUS↗