Login / Signup

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles.

Maria Paola BianchiHans-Joachim BöckenhauerJuraj HromkovicSacha KrugBjörn Steffen
Published in: Theor. Comput. Sci. (2014)
Keyphrases
  • online learning
  • real time
  • decision problems
  • data sets
  • search engine
  • three dimensional
  • database systems
  • computational cost
  • online environment