Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
27
click to vote
EOR
2008
favorite
Email
discuss
report
162
views
more
EOR 2008
»
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
13 years 11 months ago
Download
www.isima.fr
Given arbitrary source and target nodes s, t and an s
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chr&
Real-time Traffic
Arbitrary Source
|
EOR 2008
|
Optimal Solution
|
Solutions
|
claim paper
Related Content
»
A Simple Greedy Algorithm for the kDisjoint Flow Problem
»
Maximum Flows on Disjoint Paths
»
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
»
PACBayes Learning of Conjunctions and Classification of GeneExpression Data
»
Approximating Optimal Binary Decision Trees
»
Analysis of approximate nearest neighbor searching with clustered point sets
»
Landmark Selection and Greedy LandmarkDescent Routing for Sensor Networks
»
Better bounds for online load balancing on unrelated machines
»
Routing multiclass traffic flows in the plane
more »
Post Info
More Details (n/a)
Added
10 Dec 2010
Updated
10 Dec 2010
Type
Journal
Year
2008
Where
EOR
Authors
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey
Comments
(0)
Researcher Info
EOR 2010 Study Group
Computer Vision