View Document Preview and Link Document Date: 2012-11-23 03:19:45 Open Document File Size: 319,78 KB Share Result on Facebook
City Berlin / / Country Germany / Italy / Chile / / Currency pence / / / Facility Sapienza University of Rome / / IndustryTerm tree solution / online fashion / Online PTAS / 2competitive algorithm / online model / constant-competitive online algorithms / near-optimal solutions / approximation algorithm / greedy algorithm / online models / constant-competitive online algorithm / natural greedy algorithm / Online MST / natural online algorithm / constant-approximate solutions / online optimization / constant-competitive algorithms / online algorithm / online greedy algorithm / online algorithms / multimedia distribution systems / possible deterministic algorithm / online sequence / online setting / constant-competitive algorithm / software delivery / online solutions / constant-competitive solutions / online node / / Organization University of Rome / Universidad de Chile / German Academic Exchange Service / Department of Computer and System Sciences / Department of Mathematics / Berlin Mathematical School / / Person Azar / Alon / Tq / / Position problem and online Traveling Salesman / salesman / / ProgrammingLanguage TSP / / Technology online algorithm / randomized algorithm / following algorithm / online algorithms / approximation algorithm / natural greedy algorithm / natural online algorithm / greedy algorithm / possible deterministic algorithm / previous 2competitive algorithm / online greedy algorithm / / SocialTag 
The Power of Recourse for Online MST and TSP Nicole Megow1 , Martin Skutella1? , Jos´e Verschae2?? , and Andreas Wiese3? ? ? 1 3