A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi
ARTIGO
Inglês
Agradecimentos: NUMEC - NÚCLEO DE APOIO À PESQUISA EM MODELAGEM ESTOCÁSTICA E COMPLEXIDADE. We thank the referees for helpful suggestions
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQ
310974/2013-5; 459335/2014-6; 311499/2014-7; 425340/2016-3; 456792/2014-7; 306464/2016-0
FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP
2013/03447-6; 2013/07699-0; 2015/11937-9; 2016/01860-1; 2016/23552-7
fechado
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi
Fontes
|
Lecture notes in computer science (Fonte avulsa) |