Back to Results
First PageMeta Content
Computational geometry / Ε-net / Connectivity / NP / Erasure code / Planar graph / NP-complete problems / Dominating set / Tutte polynomial / Graph theory / Theoretical computer science / Mathematics


Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra
Add to Reading List

Document Date: 2013-07-29 14:22:26


Open Document

File Size: 472,98 KB

Share Result on Facebook

City

New York / /

Company

Level 3 Communications / Amazon / Plenum Press / Goodrich / Google / /

Country

United States / /

IndustryTerm

present approximation algorithms / Internet Service Providers / fault-tolerant networks / distributed storage networks / faster algorithms / content delivery networks / backbone network / residual network / approximation algorithm / even smaller-scale backbone networks / large-scale systems / internet backbone / greedy algorithm / computational geometry tools / storage systems / distributed storage systems / exponential search / machinery / fiber infrastructure / polynomial-time algorithm / wdm networks / go-to solution / computing / brute-force algorithm / sensor networking literature / fiber network / approximation algorithms / /

Organization

American Mathematical Society / /

Person

A. Dimakis / V / Alon Efrat Esther Ezra / W. Thatcher / Chaim Chojnacki / /

Position

Senator / /

ProvinceOrState

New York / /

PublishedMedium

Fundamenta Mathematicae / /

Technology

previous algorithm / Geometric Approximation Algorithms / LACEMENT Our algorithm / brute-force algorithm / Interior-point algorithms / approximation algorithm / polynomial-time algorithm / hitting-set algorithm / present approximation algorithms / file sharing / approximation algorithms / Hitting Set Algorithms / The algorithm / Hittingset algorithms / RAID / /

URL

http /

SocialTag