Frank Andrs

Andrs Frank

Information about the author Andrs Frank will soon be added to the site.
Found 8 papers in total
An algorithm for node-capacitated ring routing
An algorithm for node-capacitated ring routing
2007
A strongly polynomial time algorithm is described to solve the node-capacitated...
On Kuhn's Hungarian Method – A tribute from Hungary
On Kuhn's Hungarian Method – A tribute from Hungary
2005
Harold W. Kuhn, in his celebrated paper entitled ‘The Hungarian Method for the...
An algorithm for source location in directed graphs
An algorithm for source location in directed graphs
2005
A polynomial time solution algorithm is described to find a smallest subset R of nodes...
A constrained independent set problem for matroids
A constrained independent set problem for matroids
2004
In this note, we study a constrained independent set problem for matroids. The problem...
Node-capacitated ring routing
Node-capacitated ring routing
2002
We consider the node-capacitated routing problem in an undirected ring network along...
A note on packing paths in planar graphs
A note on packing paths in planar graphs
1995
Seymour proved that the cut criterion is necessary and sufficient for the solvability...
Algorithms for routing around a rectangle
Algorithms for routing around a rectangle
1992
Simple efficient algorithms are given for three routing problems around a rectangle....
Generalized polymatroids and submodular flows
Generalized polymatroids and submodular flows
1988
Polyhedra related to matroids and sub- or supermodular functions play a central role...
Papers per page: