Sciweavers

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

90

Voted

CORR
2016
Springer

53views Education» more CORR 2016»

Improved bounds and algorithms for graph cuts and network reliability

9 years 12 months ago

Improved bounds and algorithms for graph cuts and network reliability

Download www.cs.umd.edu

David G. Harris, Aravind Srinivasan

Real-time Traffic

CORR 2016 | Education |

claim paper

Related Content

» EdgeCut Bounds on Network Coding Rates

» Improved Approximation of MAXCUT on Graphs of Bounded Degree

» A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bou...

» A CutBased Algorithm for Reliability Analysis of TerminalPair Network Using OBDD

» Improving Exact Algorithms for MAX2SAT

» Submodular Approximation Samplingbased Algorithms and Lower Bounds

» An Olog k Approximate MinCut MaxFlow Theorem and Approximation Algorithm

» Structural Annotation of EM Images by Graph Cut

» Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

Post Info
More Details (n/a)

Added	31 Mar 2016
Updated	31 Mar 2016
Type	Journal
Year	2016
Where	CORR
Authors	David G. Harris, Aravind Srinivasan

Comments (0)