BibTeX record journals/corr/cs-DS-0306123

download as .bib file

@article{DBLP:journals/corr/cs-DS-0306123,
  author       = {Daniel Etzold},
  title        = {Heuristic to reduce the complexity of complete bipartite graphs to
                  accelerate the search for maximum weighted matchings with small error},
  journal      = {CoRR},
  volume       = {cs.DS/0306123},
  year         = {2003},
  url          = {http://arxiv.org/abs/cs/0306123},
  timestamp    = {Fri, 10 Jan 2020 12:58:52 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/cs-DS-0306123.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.