### Abstract

The authors present a preprocessing algorithm to make certain polynomial algorithms strongly polynomial. The running time of some of the known combinatorial optimization algorithms depends on the size of the objective function w. The preprocessing algorithm replaces w by an integral valued w OVER BAR whose size is polynomially bounded in the size of the combinatorial structure and which yields the same set of optimal solutions as w. It is shown how existing polynomial algorithms for finding the maximum-weight clique in a perfect graph and for the minimum cost submodular flow problem can be made strongly polynomial.

Original language | English |
---|---|

Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |

Publisher | IEEE |

Pages | 459-463 |

Number of pages | 5 |

ISBN (Print) | 0818606444, 9780818606441 |

DOIs | |

Publication status | Published - Jan 1 1985 |

### Publication series

Name | Annual Symposium on Foundations of Computer Science (Proceedings) |
---|---|

ISSN (Print) | 0272-5428 |

### ASJC Scopus subject areas

- Hardware and Architecture

## Fingerprint Dive into the research topics of 'APPLICATION OF SIMULTANEOUS APPROXIMATION IN COMBINATORIAL OPTIMIZATION.'. Together they form a unique fingerprint.

## Cite this

Frank, A., & Tardos, E. (1985). APPLICATION OF SIMULTANEOUS APPROXIMATION IN COMBINATORIAL OPTIMIZATION. In

*Annual Symposium on Foundations of Computer Science (Proceedings)*(pp. 459-463). (Annual Symposium on Foundations of Computer Science (Proceedings)). IEEE. https://doi.org/10.1109/sfcs.1985.8