DISOPT 2011 - PDF Preprint Papers

DISOPT 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DISOPT-2011 Paper

click to vote

DISOPT
2011

58views Education» more DISOPT 2011»

The parameterized complexity of k-flip local search for SAT and MAX SAT

1 years 8 days ago

Download www.kr.tuwien.ac.at

SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...

Stefan Szeider

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	58	The parameterized complexity of k-flip local search for SAT and MAX SAT	claim
2	54	On the algorithmic effectiveness of digraph decompositions and complexity measures	claim
3	53	On the directed Full Degree Spanning Tree problem	claim
4	45	The Wiener maximum quadratic assignment problem	claim
5	41	Strengthening lattice-free cuts using non-negativity	claim
6	41	Valid inequalities and branch-and-cut for the clique pricing problem	claim
7	40	Lower bounds on kernelization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers