On complexity, representation and approximation of integral multicommodity flows

The paper has two parts. In the algorithmic part integer inequality systems of packing types and their application to integral multicommodity flow problems are considered. We give 1− ε approximation algorithms using the randomized rounding/derandomization scheme provided that the components of the r...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 99; H. 1; S. 183 - 208
Hauptverfasser:	Srivastav, Anand, Stangier, Peter
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Lausanne Elsevier B.V 01.02.2000 Amsterdam Elsevier New York, NY
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorial probability Computer science; control theory; systems Derandomization Distribution theory Exact sciences and technology Integer programming Integral multicommodity flows Mathematical programming Mathematics Operational research and scientific management Operational research. Management science Probability and statistics Probability theory and stochastic processes Sciences and techniques of general use Theoretical computing 60E15 Integer programming 60C05 68Q25 90C35 Integral multicommodity flows 05C85 68R10 Derandomization Randomization Fractional flow Multicomponent analysis Network flow Angluin Valiant inequality Multicommodity flow Algorithm Computational complexity
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!