Publication date
November 1997
DOI Publisher
Academic Press. ISSN
0196-8858 Citation count (estimate)
8Abstract
AbstractWe give simple algorithmic proofs of some theorems of17and970549on the packing of metrics by cuts
AbstractWe give simple algorithmic proofs of some theorems of17and970549on the packing of metrics by cuts
This work deals with problems in Combinatorial Optimization. We study in particular some objects for...
We consider the problem of multicommodity flows in planar graphs. Seymour [Seymour, 1981] showed tha...
We consider multicommodity flow and cut problems in polymatroidal networks where there are sub-modul...
Let m be an integer-valued metric on a finite set V such that the length of any circuit on V is even...
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinati...
AbstractWe consider the undirected maximum multiflow (multicommodity flow) problem in the case when ...
AbstractLetH=(T, U)be a connected graph. AT-partitionof a setV⊇Tis a partition ofVinto subsets, each...
AbstractWe give simple algorithmic proofs of some theorems of17and970549on the packing of metrics by...
AbstractWe consider a path packing problem: given a supply graph G with a node-set N and a demand gr...
We compare two multicommodity flow problems, the maximum sum of flow, and the maximum concurrent flo...
In a multicommodity flow problem, the goal is to route paths in a supply graph G to satisfy demands ...
AbstractWe prove that if s, s′, t, t′ are vertices of a graph, and no path of fewer than k edges joi...
AbstractRecently A. Schrijver proved the following theorem. Suppose that G=(V, E) is a connected pla...
We consider the following ?multiway cut packing? problem in undirected graphs: we are given a graph ...
AbstractWe give a short proof of a theorem of Karzanov on the packing of cuts, and derive a theorem ...
This work deals with problems in Combinatorial Optimization. We study in particular some objects for...
We consider the problem of multicommodity flows in planar graphs. Seymour [Seymour, 1981] showed tha...
We consider multicommodity flow and cut problems in polymatroidal networks where there are sub-modul...
Let m be an integer-valued metric on a finite set V such that the length of any circuit on V is even...
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinati...
AbstractWe consider the undirected maximum multiflow (multicommodity flow) problem in the case when ...
AbstractLetH=(T, U)be a connected graph. AT-partitionof a setV⊇Tis a partition ofVinto subsets, each...
AbstractWe give simple algorithmic proofs of some theorems of17and970549on the packing of metrics by...
AbstractWe consider a path packing problem: given a supply graph G with a node-set N and a demand gr...
We compare two multicommodity flow problems, the maximum sum of flow, and the maximum concurrent flo...
In a multicommodity flow problem, the goal is to route paths in a supply graph G to satisfy demands ...
AbstractWe prove that if s, s′, t, t′ are vertices of a graph, and no path of fewer than k edges joi...
AbstractRecently A. Schrijver proved the following theorem. Suppose that G=(V, E) is a connected pla...
We consider the following ?multiway cut packing? problem in undirected graphs: we are given a graph ...
AbstractWe give a short proof of a theorem of Karzanov on the packing of cuts, and derive a theorem ...
This work deals with problems in Combinatorial Optimization. We study in particular some objects for...
We consider the problem of multicommodity flows in planar graphs. Seymour [Seymour, 1981] showed tha...
We consider multicommodity flow and cut problems in polymatroidal networks where there are sub-modul...
Add to ORKG