Back to Results
First PageMeta Content
NP-complete problems / Travelling salesman problem / Graph coloring / Hamiltonian path / Connectivity / Edge coloring / Bellman–Ford algorithm / Graph theory / Theoretical computer science / Mathematics


How to transform a List Coloring problem into a Traveling Salesman one DRAFT[removed]removed] Abstract This paper describes a method to transform a List Coloring Problem (LCP) into a Traveling
Add to Reading List

Document Date: 2012-11-29 03:08:56

Open Document

File Size: 34,56 KB

Share Result on Facebook

City

Berlin / Washington D.C. / /

Company

Dell / /

Country

Denmark / /

/

Facility

Santa Fe Institute / Roskilde University / /

IndustryTerm

good algorithms / others solutions / subtour-elimination algorithms / /

Organization

Congress / Santa Fe Institute / Department of Computer Science / Roskilde University / Technischen Universität Berlin / /

Person

Rk / /

Position

vp of G. We / vp / vq / salesman / vertex vp / Travelling Salesman / Traveling Salesman / /

ProgrammingLanguage

TSP / /

Technology

traveling-salesman subtour-elimination algorithms / TSP algorithm / TSP algorithms / /

SocialTag