A Polynomial Time Approximation Algorithm for the Two-Commodity Splittable Flow Problem

Elke Eisenschmidt Utz-Uwe Haus

Published in: CoRR (2011)

Keyphrases

polynomial time approximation
np hard
detection algorithm
learning algorithm
computational complexity
objective function
mathematical model
similarity measure
preprocessing
k means
vertex cover
upper bound
linear programming
theoretical analysis
convex hull