We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair {i, j} ofâ€¦ (More)

Philip Klein4 Aj it Agrawalt R. Ravit Satish RaoJ In this paper, we prove the first approximate max-flow mincut theorem for general multicommodity flow. We use it to get approximation algorithms forâ€¦ (More)

In this paper, we give the first polynomial time approximation algorithms for two problems in combinatorial optimization. The first problem is single-processor scheduling to minimize weighted sum ofâ€¦ (More)

In this paper , we prove the first approximate max-flow min-cut theorem for undirected mul t i commodi ty flow. We show tha t for a feasible flow to exist in a mul t icommodi ty problem, it isâ€¦ (More)

Carcinoma of the uterine cervix is the most common gynecological malignancy in developing countries. However, its cutaneous metastasis is a rare entity. The reported incidence of cutaneous metastasisâ€¦ (More)

In this paper, we present a high-speed fault simulator called CMP3F, performing parallel pattern parallel fault simulation, implemented on the Connection MachineZ (CM). Unlike conventional parallelâ€¦ (More)

We give the rst polynomial-time approximation algorithms for three problems in combina-torial optimization using approximation algorithms for nding balanced separators. The rst problem is registerâ€¦ (More)