%0 Conference Paper %1 Neumann08cutHeuristic %A Neumann, Frank %A Reichel, Joachim %A Skutella, Martin %B GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation %C New York, NY, USA %D 2008 %I ACM %K 08 Neumann cut graph heuristic %P 779--786 %R http://doi.acm.org/10.1145/1389095.1389250 %T Computing minimum cuts by randomized search heuristics %U http://portal.acm.org/citation.cfm?id=1389250 %@ 978-1-60558-130-9

@inproceedings{Neumann08cutHeuristic, added-at = {2008-12-03T02:34:51.000+0100}, address = {New York, NY, USA}, author = {Neumann, Frank and Reichel, Joachim and Skutella, Martin}, biburl = {https://www.bibsonomy.org/bibtex/2bb4d5f36c35009fd83e5792a4d1bbb87/lee_peck}, booktitle = {GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation}, description = {Computing minimum cuts by randomized search heuristics}, doi = {http://doi.acm.org/10.1145/1389095.1389250}, interhash = {bc2e99830272bb3823c74c867e6c0968}, intrahash = {bb4d5f36c35009fd83e5792a4d1bbb87}, isbn = {978-1-60558-130-9}, keywords = {08 Neumann cut graph heuristic}, location = {Atlanta, GA, USA}, pages = {779--786}, publisher = {ACM}, timestamp = {2008-12-03T02:34:51.000+0100}, title = {Computing minimum cuts by randomized search heuristics}, url = {http://portal.acm.org/citation.cfm?id=1389250}, year = 2008 }