Approximate Bipartite b-Matching using Multiplicative Auction: Algorithm and Analysis
Entwicklung eines (1 - ε)-Approximationsalgorithmus für das bipartite b-Matching unter Verwendung einer multiplikativen Auktion.
Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model
Optimale Approximationsgarantien in Mechanismen mit Vorhersagen sind herausfordernd.
MaxCUCL: Max-Consensus in Networks with Unreliable Communication Links
MaxCUCL ermöglicht deterministische Max-Konsens in Netzwerken mit unzuverlässigen Kommunikationsverbindungen.
Analyzing Local Computation of PageRank Algorithm
Revisiting the complexity of ApproxContributions and BiPPR algorithms for efficient PageRank estimation.
Directed Expander Decompositions Algorithm
Maintaining expander decompositions in directed graphs efficiently.
Adapted Convex Hull Cheapest Insertion Heuristic for Precedence Constrained Traveling Salesperson Problems
Adapting the CHCI algorithm for TSP-PC with precedence constraints outperforms NN heuristic.
Analyzing Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
CC-MaxSat and Maximum Coverage are equivalent in FPT-Approximation parameterized by k, allowing for a randomized reduction preserving the approximation guarantee. This equivalence leads to faster algorithms for CC-MaxSat by utilizing known good algorithms for Maximum Coverage.
Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model
The authors aim to design strategyproof mechanisms leveraging predictions for improved approximation guarantees in the Generalized Assignment Problem (GAP) within the private graph model.
© 2024 by Linnk AI