An application of simultaneous diophantine approximation in combinatorial optimization

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1987 English Publisher:Springer Science and Business Media LLCJournal:Combinatorica, volume 7, pages 49-65 (issn: 0209-9683, eissn: 1439-6912,

Copyright policy )

Authors: András Frank; Éva Tardos;

doi: 10.1007/bf02579200

An application of simultaneous diophantine approximation in combinatorial optimization

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Eötvös Loránd University
Hungary

Keywords

simultaneous Diophantine approximation, Combinatorial optimization, minimum cost submodular flow, Analysis of algorithms and problem complexity, Deterministic network models in operations research, maximum weight clique, perfect graph, Integer programming, strongly polynomial time, Programming involving graphs or networks, preprocessing

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	195
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average