Zobrazeno 1 - 10
of 410
pro vyhledávání: '"Goldberg, A. V."'
Autor:
Dong, Yuanyuan, Goldberg, Andrew V., Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C., Spaen, Quico
Motivated by a real-world vehicle routing application, we consider the maximum-weight independent set problem: Given a node-weighted graph, find a set of independent (mutually nonadjacent) nodes whose node-weight sum is maximum. Some of the graphs ai
Externí odkaz:
http://arxiv.org/abs/2203.15805
Autor:
Rona, Gergely, Miwatani-Minter, Bearach, Zhang, Qingyue, Goldberg, Hailey V., Kerzhnerman, Marc A., Howard, Jesse B., Simoneschi, Daniele, Lane, Ethan, Hobbs, John W., Sassani, Elizabeth, Wang, Andrew A., Keegan, Sarah, Laverty, Daniel J., Piett, Cortt G., Pongor, Lorinc S., Xu, Miranda Li, Andrade, Joshua, Thomas, Anish, Sicinski, Piotr, Askenazi, Manor, Ueberheide, Beatrix, Fenyö, David, Nagel, Zachary D., Pagano, Michele
Publikováno v:
In Molecular Cell 4 April 2024 84(7):1224-1242
Autor:
Dong, Yuanyuan, Goldberg, Andrew V., Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C., Spaen, Quico
We present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 8
Externí odkaz:
http://arxiv.org/abs/2105.12623
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Scott, Nigel A., Lee, Kara K., Sadowski, Claire, Kurbatova, Ekaterina V., Goldberg, Stefan V., Nsubuga, Pheona, Kitshoff, Rene, Whitelaw, Colleen, Thuy, Hanh Nguyen, Batra, Kumar, Allen-Blige, Cynthia, Davis, Howard, Kim, Jay, Phan, Mimi, Fedrick, Pamela, Chiu, Kuo Wei, Heilig, Charles M., Sizemore, Erin
Publikováno v:
In Contemporary Clinical Trials June 2021 105
Autor:
Dong, Yuanyuan, Goldberg, Andrew V., Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C., Spaen, Quico
Publikováno v:
Networks; Jan2025, Vol. 85 Issue 1, p91-112, 22p
Hub Labeling (HL) is a data structure for distance oracles. Hierarchical HL (HHL) is a special type of HL, that received a lot of attention from a practical point of view. However, theoretical questions such as NP-hardness and approximation guarantee
Externí odkaz:
http://arxiv.org/abs/1501.02492
Autor:
Dorman, Susan E., Nahid, Payam, Kurbatova, Ekaterina V., Goldberg, Stefan V., Bozeman, Lorna, Burman, William J., Chang, Kwok-Chiu, Chen, Michael, Cotton, Mark, Dooley, Kelly E., Engle, Melissa, Feng, Pei-Jean, Fletcher, Courtney V., Ha, Phan, Heilig, Charles M., Johnson, John L., Lessem, Erica, Metchock, Beverly, Miro, Jose M., Nhung, Nguyen Viet, Pettit, April C., Phillips, Patrick P.J., Podany, Anthony T., Purfield, Anne E., Robergeau, Kathleen, Samaneka, Wadzanai, Scott, Nigel A., Sizemore, Erin, Vernon, Andrew, Weiner, Marc, Swindells, Susan, Chaisson, Richard E.
Publikováno v:
In Contemporary Clinical Trials March 2020 90
In the context of distance oracles, a labeling algorithm computes vertex labels during preprocessing. An $s,t$ query computes the corresponding distance from the labels of $s$ and $t$ only, without looking at the input graph. Hub labels is a class of
Externí odkaz:
http://arxiv.org/abs/1304.5973