Search Results for author:
Found 2 papers, 0 papers with code
Multilevel Memetic Hypergraph Partitioning with Greedy Recombination
The performance of our algorithm is compared with the state-of-the-art HGP algorithms on $150$ real-life instances taken from the benchmark datasets used in the literature.
On Singleton Congestion Games with Resilience Against Collusion
We study the subclass of singleton congestion games with identical and increasing cost functions, i. e., each agent tries to utilize from the least crowded resource in her accessible subset of resources.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
