Back to Results
First PageMeta Content
Approximation algorithms / Operations research / NP-complete problems / Computational complexity theory / Greedy algorithm / Matroid theory / Travelling salesman problem / Domination analysis / Nearest neighbour algorithm / Mathematics / Theoretical computer science / Applied mathematics


Document Date: 2004-02-01 08:10:15

Open Document

File Size: 155,83 KB

Share Result on Facebook

City

Berlin / Prague / /

Company

Vertex / /

/

Facility

University of London Egham / /

IndustryTerm

polynomial time algorithms / worst possible solution / above mentioned algorithms / approximation algorithm / polynomial time algorithm / greedy algorithm / greedy-type algorithm / polynomial time approximation algorithms / heuristic solution / nearest neighbor algorithm / deterministic approximation algorithm / scale neighborhood search techniques / approximate solutions / feasible solutions / /

Organization

Leverhulme Foundation / Anders Yeo Department of Computer Science Royal Holloway / University of London Egham / /

Person

G. Gambosi / V / Max Cut / Anders Yeo / Ai / Gregory Gutin / /

Position

Traveling Salesman / salesman / Asymmetric Traveling Salesman / /

ProgrammingLanguage

TSP / /

Technology

4.1 The algorithm / following approximation algorithm / greedy-type algorithm / following greedy-type algorithm / ATSP algorithm / deterministic approximation algorithm / polynomial time algorithm / polynomial time QAP algorithm / approximation algorithm / greedy algorithm / nearest neighbor algorithm / J. Algorithms / DOM-good algorithm / 5 6 Greedy Algorithm / DOM / polynomial time algorithms / polynomial time approximation algorithms / ATSP algorithms / polynomial time ATSP algorithm / above mentioned algorithms / two algorithms / /

SocialTag