@inbook {1987,
	title = {Fast Heuristics for Eliminating Switching Components in Binary Matrices by 0-1 Flips},
	booktitle = {Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications: 19th Iberoamerican Congress (CIARP)},
	series = {LNCS},
	number = {8827},
	year = {2014},
	month = {2014},
	pages = {62-69},
	publisher = {Springer},
	organization = {Springer},
	type = {Conference paper},
	address = {Puerto Vallarta, Mexico},
	abstract = {<p>Switching components are special patterns in binary matrices that play an essential role in many image processing and pattern analysis tasks. Finding the minimal number of 0s that must be switched to 1s in order to eliminate all switching components is an NP-complete problem. We present two novel-type heuristics for the above problems and show via experiments that they outperform the formerly proposed ones, both in optimality and in running time.</p>},
	isbn = {978-3-319-12567-1},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-12568-8_8},
	author = {Norbert Hantos and P{\'e}ter Bal{\'a}zs},
	editor = {E. Bayro-Corrochano and E. Hancock}
}
