Back to Results
First PageMeta Content
Graph connectivity / Combinatorial optimization / Connectivity / Shortest path problem / Cut / Bridge / Maximum flow problem / Eulerian path / Graph theory / Mathematics / Theoretical computer science


Improved Approximation for the Directed Spanner Problem∗ Piotr Bermana , Arnab Bhattacharyyab,1 , Konstantin Makarychevc , Sofya Raskhodnikovaa,2 , Grigory Yaroslavtseva,2 a
Add to Reading List

Document Date: 2014-06-08 22:16:08

Open Document

File Size: 253,01 KB

Share Result on Facebook

City

Park / Cambridge / /

Company

IBM / /

Facility

University Park / Massachusetts Institute of Technology / /

IndustryTerm

algorithm / solutions / approximation algorithm / feasible solution / polynomial time algorithm / streaming algorithms / approximate solution / ellipsoid algorithm / fractional solution / integral solution / /

NaturalFeature

Directed Steiner Forest / /

Organization

In Section / National Science Foundation / Pennsylvania State University / Massachusetts Institute of Technology / College of Engineering Fellowship / /

Person

Sofya Raskhodnikovaa / Piotr Bermana / Arnab Bhattacharyyab / Konstantin Makarychevc / Grigory Yaroslavtseva / Grigory Yaroslavtsev / /

ProvinceOrState

Pennsylvania / New York / Massachusetts / /

Technology

main algorithm / randomized algorithm / resulting algorithm / polynomial time algorithm / ellipsoid algorithm / approximation algorithm / 4 All algorithms / Techniques Our algorithms / separate algorithm / 5 Algorithm / /

SocialTag