Search
Search Results
-
The Time Complexity of Consensus Under Oblivious Message Adversaries
We study the problem of solving consensus in synchronous directed dynamic networks, in which communication is controlled by an oblivious message...
-
-
Efficient Top-k Frequent Itemset Mining on Massive Data
Top- k frequent itemset mining (top- k FIM) plays an important role in many practical applications. It reports the k itemsets with the highest...
-
-
-
Where To Go at the Next Timestamp
The next Point of Interest ( POI ) recommendation is the core technology of smart city. Current state-of-the-art models attempt to improve the accuracy...
-
Improved FPT Algorithms for Deletion to Forest-Like Structures
The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterized Complexity. In this problem, given an...
-
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Our work concerns algorithms for a variant of
Maximum Flow in unweighted graphs. In theAll-Pairs Connectivity (APC) problem, we are given a graph G ...
-
Construct and Query A Fine-Grained Geospatial Knowledge Graph
In this paper, we propose the fine-grained geospatial knowledge graph (FineGeoKG), which can capture the neighboring relations between geospatial...
-
Explicit Behavior Interaction with Heterogeneous Graph for Multi-behavior Recommendation
Multi-behavior recommendation systems exploit multi-type user–item interactions (e.g., clicking, adding to cart and collecting) as auxiliary...
-
DB-GPT: Large Language Model Meets Database
Large language models (LLMs) have shown superior performance in various areas. And LLMs have the potential to revolutionize data management by...
-
Truthful Matching with Online Items and Offline Agents
We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multi-parameter) setting, every buyer is associated with...
-
Predecessor on the Ultra-Wide Word RAM
We consider the predecessor problem on the ultra-wide word RAM model of computation, which extends the word RAM model with ultrawords consisting of
... 
-
-
Approximations for Throughput Maximization
In this paper we study the classical problem of throughput maximization. In this problem we have a collection J of n jobs, each having a release time
... 
-
-
Combinatorial Algorithms 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1–3, 2024, Proceedings
This book constitutes the refereed proceedings of the 35th International Workshop on Combinatorial Algorithms, IWOCA 2024, held in Ischia, Italy,...
-
Combinatorial Optimization 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22–24, 2024, Revised Selected Papers
This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna,...
-
Intelligent Optimization Principles, Algorithms and Applications
This textbook comprehensively explores the foundational principles, algorithms, and applications of intelligent optimization, making it an ideal...
