Tardos va

va Tardos

Information about the author va Tardos will soon be added to the site.
Found 10 papers in total
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
2009
The smallest k-ECSS problem is, given a graph along with an integer k , find a...
Primal–dual-based algorithms for a directed network design problem
2005
We present efficient algorithms for a special case of network design problems, the...
Algorithms for a network design problem with crossing supermodular demands
2004
We present approximation algorithms for a class of directed network design problems....
An approximation algorithm for the generalized assignment problem
1993
The generalized assignment problem can be viewed as the following problem of...
Polynomial dual network simplex algorithms
1993
The authors show how to use polynomial and strongly polynomial capacity scaling...
Algorithms for routing around a rectangle
1992
Simple efficient algorithms are given for three routing problems around a rectangle....
Approximation algorithms for scheduling unrelated parallel machines
1990
The authors consider the following scheduling problem. There are m parallel machines...
An O(n2(m+nlogn)logn) min-cost flow algorithm
1988
The minimum-cost flow problem is: Given a network with n vertices and m edges, find a...
Note on Weintraub’s minimum-cost circulation algorithm
1989
In 1974 Weintraub published an algorithm for the minimum-cost circulation problems...
Generalized polymatroids and submodular flows
1988
Polyhedra related to matroids and sub- or supermodular functions play a central role...
Papers per page: