* [Caml-list] feedback arc set problem
@ 2012-02-28 17:25 Pietro Abate
0 siblings, 0 replies; only message in thread
From: Pietro Abate @ 2012-02-28 17:25 UTC (permalink / raw)
To: caml-list
hello world,
Before starting coding it myself, I'm wondering if somebody has
already a bit of code to solve the minimum feedback arc set problem
[1]. Bonus points if your solution considers weighed graphs ...
I'm looking for an approximate solution. I've read a few articles and
it seems that despite the problem is np-hard, approximate solutions
have acceptable bounds .
help ?
[clearly this is not solved in ocamlgraph, isn't it ?]
[1] http://en.wikipedia.org/wiki/Feedback_arc_set
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2012-02-28 17:26 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2012-02-28 17:25 [Caml-list] feedback arc set problem Pietro Abate
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).