NETWORKS 2011 - PDF Preprint Papers

NETWORKS 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NETWORKS-2011 Paper

click to vote

NETWORKS
2011

56views Computer Networks» more NETWORKS 2011»

Line planning, path constrained network flow and inapproximability

1 years 9 days ago

Download www.diel.univaq.it

Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...

Christina Büsing, Sebastian Stiller

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	56	Line planning, path constrained network flow and inapproximability	claim
2	48	Earliest arrival flows on series-parallel graphs	claim
3	43	On terminal delta-wye reducibility of planar graphs	claim
4	38	On cut-based inequalities for capacitated network design polyhedra	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers