User Tools

Site Tools


2ima00

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
2ima00 [2016/05/26 12:15]
bmpjansen [Student lectures]
2ima00 [2016/05/26 12:16]
bmpjansen [Student lectures]
Line 151: Line 151:
  
 [[http://​link.springer.com/​chapter/​10.1007%2F3-540-36379-3_25|Ton Kloks, C.M. Lee, Jiping Liu. New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs]] (page 8 and further) [[http://​link.springer.com/​chapter/​10.1007%2F3-540-36379-3_25|Ton Kloks, C.M. Lee, Jiping Liu. New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs]] (page 8 and further)
 +
 +I don't know which of the 2 approaches will be faster on the inputs we have; one has a worse polynomial term, the other has a worse factor f(k). I don't think it is feasible to implement both, given the time. Pick one of the two and go for it.
  
 **Parameterized by solution size (iterative compression & randomized):​ Huib & Stefan.** **Parameterized by solution size (iterative compression & randomized):​ Huib & Stefan.**
2ima00.txt ยท Last modified: 2016/05/26 12:27 by bmpjansen