Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Approximating the single source unsplittable min-cost flow problem
Home
Publications
Approximating the single source unsplittable min-cost flow problem
Approximating the single source unsplittable min-cost flow problem
Author:
MS
Martin Skutella
Martin Skutella
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 February 2002
journal article
Published by
Springer Nature
in
Mathematical Programming
Vol. 91
(3)
,
493-514
DOI:
10.1007/s101070100260
Abstract
No abstract available
Keywords
OPTIMIZATION
HARDNESS
APPROXIMATION
PROBLEM
FLOW
EDGE
CONSTRAINT
COMMODITY
KLEINBERG
UNSPLITTABLE
Cited
Cited by 53 articles
Scroll to top