Loading…
Loading…
Loading…
Dispersing Obnoxious Facilities on a Graph
Grigoriev, Alexander, Hartmann, Tim A., Lendl, Stefan, Woeginger, Gerhard J.
Published in Algorithmica (01.06.2021)
Published in Algorithmica (01.06.2021)
Get full text
Journal Article
Loading…
Loading…
Loading…
Loading…
A Randomized O(log2k)-Competitive Algorithm for Metric Bipartite Matching
Bansal, Nikhil, Buchbinder, Niv, Gupta, Anupam, Naor, Joseph (Seffi)
Published in Algorithmica (01.02.2014)
Published in Algorithmica (01.02.2014)
Get full text
Journal Article
Loading…
Loading…
Fair Matchings and Related Problems
Huang, Chien-Chung, Kavitha, Telikepalli, Mehlhorn, Kurt, Michail, Dimitrios
Published in Algorithmica (01.03.2016)
Published in Algorithmica (01.03.2016)
Get full text
Journal Article
Loading…
Loading…
Algorithms for Communication Scheduling in Data Gathering Network with Data Compression
Luo, Wenchang, Xu, Yao, Gu, Boyuan, Tong, Weitian, Goebel, Randy, Lin, Guohui
Published in Algorithmica (01.11.2018)
Published in Algorithmica (01.11.2018)
Get full text
Journal Article
Loading…
Loading…
Loading…
TKFIM: Top-K frequent itemset mining technique based on equivalence classes
Iqbal, Saood, Shahid, Abdul, Roman, Muhammad, Khan, Zahid, Al-Otaibi, Shaha, Yu, Lisu
Published in PeerJ. Computer science (08.03.2021)
Published in PeerJ. Computer science (08.03.2021)
Get full text
Journal Article
Loading…
Loading…
Regular Decomposition of Large Graphs: Foundation of a Sampling Approach to Stochastic Block Model Fitting
Reittu, Hannu, Norros, Ilkka, Räty, Tomi, Bolla, Marianna, Bazsó, Fülöp
Published in Data Science and Engineering (01.03.2019)
Published in Data Science and Engineering (01.03.2019)
Get full text
Journal Article