The Maximum Robust Flow problem asks for a flow on the paths of a network maximizing the guaranteed amount of flow surviving the removal of any arcs. We point out a flaw in a previous publication that claimed -hardness for this problem when . For the case that is part of the input, we present a new hardness proof. We also discuss the complexity of the integral version of the problem
This paper deals with robust optimization and network flows. Several robust variants of integer flow...
A dynamic network consists of a directed graph with a source s, a sink t and capacities and integral...
We study continuous analogues of “vitality” for discrete network flows/paths, and consider problems ...
The Maximum Robust Flow problem asks for a flow on the paths of a network maximizing the guaranteed ...
The authors settle the complexity status of the robust network design problem in undirected graphs. ...
International audienceWe consider two variants of a max-flow problem against $k$ edge failures, each...
The authors settle the complexity status of the robust net-work design problem in undirected graphs....
AbstractIn an earlier paper we develop a quite general dual method and apply it to balanced submodul...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
For the maximal flow problem in a pure network there is a simple criterion for optimality: "the flow...
The problem of finding maximal flow in networks with barrier reachability is considered. It is shown...
We introduce and investigate reroutable flows, a robust version of network flows in which link failu...
When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$-Arc Destructi...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
This paper deals with robust optimization and network flows. Several robust variants of integer flow...
A dynamic network consists of a directed graph with a source s, a sink t and capacities and integral...
We study continuous analogues of “vitality” for discrete network flows/paths, and consider problems ...
The Maximum Robust Flow problem asks for a flow on the paths of a network maximizing the guaranteed ...
The authors settle the complexity status of the robust network design problem in undirected graphs. ...
International audienceWe consider two variants of a max-flow problem against $k$ edge failures, each...
The authors settle the complexity status of the robust net-work design problem in undirected graphs....
AbstractIn an earlier paper we develop a quite general dual method and apply it to balanced submodul...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
For the maximal flow problem in a pure network there is a simple criterion for optimality: "the flow...
The problem of finding maximal flow in networks with barrier reachability is considered. It is shown...
We introduce and investigate reroutable flows, a robust version of network flows in which link failu...
When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$-Arc Destructi...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
This paper deals with robust optimization and network flows. Several robust variants of integer flow...
A dynamic network consists of a directed graph with a source s, a sink t and capacities and integral...
We study continuous analogues of “vitality” for discrete network flows/paths, and consider problems ...
DOI
Add to ORKG