Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

OR
2007
Springer

favoriteEmaildiscussreport

143views Operations Research» more OR 2007»

Optimizing in Graphs with Expensive Computation of Edge Weights

14 years 1 months ago

Optimizing in Graphs with Expensive Computation of Edge Weights

Download biocomputing.mi.fu-berlin.de

Frank Noé, Marcus Oswald, Gerhard Reinelt

Real-time Traffic

Operations Research | OR 2007 |

claim paper

Related Content

» Edge Weight Regularization over Multiple Graphs for Similarity Learning

» Approximate maximum weight branchings

» The Max kCut Game and Its Strong Equilibria

» A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

» The Computational Complexity of the Minimum Weight Processor Assignment Problem

» Optimal Query Complexity for Reconstructing Hypergraphs

» Minimum weight triangulation is NPhard

» Toward Optimal Diffusion Matrices

» Optimal query complexity bounds for finding graphs

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	OR
Authors	Frank Noé, Marcus Oswald, Gerhard Reinelt

Comments (0)