@inproceedings{4e70df3d15dc467c93b08a0ea4eded2d,

title = "Quadratic programming and combinatorial minimum weight product problems",

abstract = "We present a fully polynomial time approximation scheme (FPTAS) for minimizing an objective (aT x + ¿)(bTx + d) under linear constraints Ax = d. Examples of such problems are combinatorial minimum weight product problems such as, e.g., the following: Given a graph G = (V,E) and two edge weights a, b : E ¿ R+ find an s-t path P that minimizes a(P)b(P), the product of its edge weights relative to a and b.",

author = "W. Kern and G.J. Woeginger",

year = "2006",

doi = "10.1007/11758471_7",

language = "English",

isbn = "3-540-34375-X",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "42--49",

editor = "T. Calamoneri and I. Finocchi and G.F. Italiano",

booktitle = "Algorithms and Complexity (Proceedings 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006)",

address = "Germany",

}