Sciweavers

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

57

APPROX
2010
Springer

favoriteEmaildiscussreport

136views Algorithms» more APPROX 2010»

Vertex Sparsifiers: New Results from Old Techniques

14 years 10 months ago

Vertex Sparsifiers: New Results from Old Techniques

Download research.microsoft.com

Matthias Englert, Anupam Gupta, Robert Krauthgamer

Real-time Traffic

Algorithms | APPROX 2010 |

claim paper

Related Content

» EBusiness Strategy Formulating and Forming New Wine in Old Bottles

» Lifting nonfinite axiomatizability results to extensions of process algebras

» Modeling shapes and textures from images new frontiers

» 3D Meshes Registration Application to Statistical Skull Model

» A new perspective on implementation by voting trees

» PSoup a system for streaming queries over streaming data

» A widerange algorithm for minimal triangulation from an arbitrary ordering

» How to Pay Come What May Approximation Algorithms for DemandRobust Covering Problems

» Early Identification of Incompatibilities in Multicomponent Upgrades

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2010
Where	APPROX
Authors	Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar

Comments (0)