A Recursive Greedy Algorithm for Walks in Directed Graphs

About this presentation

Algorithms for k-Stroll in dir graphs. k=nis asymmetric TSP Path problem (ATSPP). O(√n) approx[Lam-Newman'05]; O(logn) approx [C-Pal'06]. Bicriteria(α, β) ...

How to use this file

This page is a search result, not an assignment you should present unchanged. Check the original source, rebuild the outline in your own words, and cite the author. PPT Finder does not host the PowerPoint file.

• How to cite a PowerPoint
• Choosing slides for a student project
• Structuring a seminar