Most balanced minimum cuts and partially ordered knapsack. Bonsma, P. S. In Proceedings of Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), pages 17-21, 2007.
bibtex   
@inproceedings{ dblp3168183,
  title = {Most balanced minimum cuts and partially ordered knapsack},
  author = {Paul S. Bonsma},
  author_short = {Bonsma, P. S.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2007},
  key = {dblp3168183},
  id = {dblp3168183},
  biburl = {http://www.dblp.org/rec/bibtex/conf/colognetwente/Bonsma07},
  url = {},
  conference = {CTW},
  pages = {17-21},
  text = {CTW 2007:17-21},
  booktitle = {Proceedings of Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW)}
}

Downloads: 0