%0 Journal Article %1 journals/ijfcs/DessmarkJLLP07 %A Dessmark, Anders %A Jansson, Jesper %A Lingas, Andrzej %A Lundell, Eva-Marta %A Persson, Mia %D 2007 %J Int. J. Found. Comput. Sci. %K %N 2 %P 217-226 %T On the Approximability of Maximum and Minimum Edge Clique Partition Problems. %U http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs18.html#DessmarkJLLP07 %V 18

@article{journals/ijfcs/DessmarkJLLP07, added-at = {2023-12-13T01:03:21.000+0100}, author = {Dessmark, Anders and Jansson, Jesper and Lingas, Andrzej and Lundell, Eva-Marta and Persson, Mia}, biburl = {https://www.bibsonomy.org/bibtex/27de952b7d36fcc6e5d6789b22fe40638/admin}, ee = {https://doi.org/10.1142/S0129054107004656}, interhash = {6c337a398ea501eb7760cac45b2f44e4}, intrahash = {7de952b7d36fcc6e5d6789b22fe40638}, journal = {Int. J. Found. Comput. Sci.}, keywords = {}, number = 2, pages = {217-226}, timestamp = {2023-12-13T01:03:21.000+0100}, title = {On the Approximability of Maximum and Minimum Edge Clique Partition Problems.}, url = {http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs18.html#DessmarkJLLP07}, volume = 18, year = 2007 }