Degree constrained subgraph problems and network flow optimization. - Augsburg : Wißner, 1997. - 172 S. - (Augsburger mathematisch-naturwissenschaftliche Schriften ; 21). - Zugl.: Augsburg, Univ., Diss., 199
A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-w...
A d-furcated ow is a network ow whose support graph has maximum outdegree d. Take a single-sink mu...
For a distributive flow programming optimization problem of a special structure direct and dual algo...
Degree constrained subgraph problems and network flow optimization. - Augsburg : Wißner, 1997. - 172...
Ph.D.Applied SciencesEngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studies...
15.082J/6.855J is an H-level graduate subject in the theory and practice of network flows and its ex...
La premi ere partie de cette th ese s'int eresse au groupage de tra c dans les r eseaux de t el eco...
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum...
AbstractIn this article we provide hardness results and approximation algorithms for the following t...
International audienceIn this article we provide hardness results and approximation algorithms for t...
AbstractThe degree constrained subgraph problem is to find a subgraph of a graph with degrees as clo...
We consider degree bounded network design problems with element and vertex connectivity requirements...
We consider one extremal linear non-homogeneous problem of flow programming with additional constrai...
For an linear non-homogeneous flow programming problem with additional constraints of general kind a...
AbstractA linear-time algorithm that reduces the set of flows on a directed graph with an additional...
A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-w...
A d-furcated ow is a network ow whose support graph has maximum outdegree d. Take a single-sink mu...
For a distributive flow programming optimization problem of a special structure direct and dual algo...
Degree constrained subgraph problems and network flow optimization. - Augsburg : Wißner, 1997. - 172...
Ph.D.Applied SciencesEngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studies...
15.082J/6.855J is an H-level graduate subject in the theory and practice of network flows and its ex...
La premi ere partie de cette th ese s'int eresse au groupage de tra c dans les r eseaux de t el eco...
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum...
AbstractIn this article we provide hardness results and approximation algorithms for the following t...
International audienceIn this article we provide hardness results and approximation algorithms for t...
AbstractThe degree constrained subgraph problem is to find a subgraph of a graph with degrees as clo...
We consider degree bounded network design problems with element and vertex connectivity requirements...
We consider one extremal linear non-homogeneous problem of flow programming with additional constrai...
For an linear non-homogeneous flow programming problem with additional constraints of general kind a...
AbstractA linear-time algorithm that reduces the set of flows on a directed graph with an additional...
A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-w...
A d-furcated ow is a network ow whose support graph has maximum outdegree d. Take a single-sink mu...
For a distributive flow programming optimization problem of a special structure direct and dual algo...
Add to ORKG