Questions tagged [exp-time-algorithms]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
9
votes
2answers
5k views

Time complexity of Held-Karp algorithm for TSP

When I looked through "A Dynamic Programming Approach to Sequencing Problems" by Michael Held and Richard M. Karp, I came up with the following question: why the complexity of their algorithm for TSP ...
39
votes
2answers
915 views

How many distinct colors are needed to lower-bound the choosability of a graph?

A graph is $k$-choosable (also known as $k$-list-colorable) if, for every function $f$ that maps vertices to sets of $k$ colors, there is a color assignment $c$ such that, for all vertices $v$, $c(v)\...
0
votes
2answers
3k views

Dynamic programming algorithm for NP-complete problem

Hello everybody here is a problem i have approximated but would like to hear your opinion about. Perhaps someone finds a better solution than me :) Given a Graph G with undirected edges: Divide it ...