scientific article; zbMATH DE number 1263177

From MaRDI portal

Revision as of 15:31, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4234047

Jump to:navigation, search

zbMath0922.90065MaRDI QIDQ4234047

David R. Karger, Serge A. Plotkin

Publication date: 18 October 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

round-robin approximate packing minimum cost multicommodity flow

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (4)

Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time ⋮ Unnamed Item ⋮ Modifying edges of a network to obtain short subgraphs ⋮ A penalty function heuristic for the resource constrained shortest path problem

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4234047&oldid=18115272"