A* with negative edges
I'm researching on shortest path algorithms for a special graph set with negative weights (no neg. cycles)
I found a consistent A* heuristic for them.
Now I'm searchign for related work. Unfortunately it seems everybody only works with positive edges. I appreciate if somebody could point be to some literature references. Thx.
Google search yields Bellman-Ford algorithm and this book chapter. Have you looked in Knuth's "Art of Computer Programming"?
We know Bellmann-Ford solves the problem in O(n^3).
Our heuristic for a sub problem solves it in O(n^2).
We are interested in research about A* for negative edges.