Simple on-line algorithms for the maximum disjoint paths problem - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Petr Kolman, Christian Scheideler. Simple on-line algorithms for the maximum disjoint paths problem. In SPAA. pages 38-47, 2001. [doi]

@inproceedings{KolmanS01,
  title = {Simple on-line algorithms for the maximum disjoint paths problem},
  author = {Petr Kolman and Christian Scheideler},
  year = {2001},
  doi = {10.1145/378580.378586},
  url = {http://doi.acm.org/10.1145/378580.378586},
  researchr = {https://researchr.org/publication/KolmanS01},
  cites = {0},
  citedby = {0},
  pages = {38-47},
  booktitle = {SPAA},
}

runs on WebDSL