A Soft Constraint of Equality: Complexity and Approximability? Emmanuel Hebrard, Barry O’Sullivan, and Igor Razgon Cork Constraint Computation Centre Department of Computer Science, University College Cork, Ireland {e.

First Page		Document Content
Date: 2010-11-22 06:22:30 Mathematics Local consistency Constraint satisfaction Constraint optimization Mathematical optimization Static single assignment form FO Variable Parameterized complexity Constraint programming Software engineering Theoretical computer science		A Soft Constraint of Equality: Complexity and Approximability? Emmanuel Hebrard, Barry O’Sullivan, and Igor Razgon Cork Constraint Computation Centre Department of Computer Science, University College Cork, Ireland {e. Add to Reading List Source URL: homepages.laas.fr Download Document from Source Website File Size: 244,87 KB Share Document on Facebook

	Representative Families and Kernels Fahad Panolan Department of Informatics, University of Bergen, Norway Parameterized Complexity Summer School DocID: 1vk0H - View Document
	Some open problems in parameterized complexity Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary DocID: 1v7gN - View Document
	Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer School DocID: 1uKug - View Document
	Discrete Applied Mathematics – 429 www.elsevier.com/locate/dam Parameterized complexity of vertex colouring Leizhen Cai ∗ DocID: 1uqiK - View Document
	Parameterized complexity of even/odd subgraph problems DocID: 1up1m - View Document