A weighted point-availability time-dependent network is a list of temporal edges, where each temporal edge has an appearing time value, a travel time value, and a cost value. In this paper we consider the single source Pareto problem in weighted point-availability time-dependent networks, which consists of computing, for any destination d, all Pareto optimal pairs (t, c), where t and c are the arrival time and the cost of a path from s to d, respectively (a pair (t, c) is Pareto optimal if there is no path with arrival time smaller than t and cost no worse than c or arrival time no greater than t and better cost). We design and analyse a general algorithm for solving this problem, whose time complexity is O(M log P), where M is the number of temporal edges and P is the maximum number of Pareto optimal pairs for each node of the network. This complexity significantly improves the time complexity of the previously known solution. Our algorithm can be used to solve several different minimum cost path problems in weighted point-availability time-dependent networks with a vast variety of cost definitions, and it can be easily modified in order to deal with the single destination Pareto problem. All our results apply to directed networks, but they can be easily adapted to undirected networks with no edges with zero travel time.
Faster Distance-Based Representative Skyline and $k$-Center Along Pareto Front in the Plane
我们考虑在平面中计算\emph{distance-based representative skyline}的问题,这是由Tao,Ding,Lin和Pei [Proc.25th IEEE International Conference on Data Engineering(ICDE),2009]引入的问题,并由Dupin,Nielsen和Talbi [Optimization and Learning - Third International Conference,OLA 2020]在多目标优化的背景下独立考虑。给定平面中的$n$点的集合$P$和参数$k$,任务是选择由$P$定义的天际线的$k$点(也称为$P$的帕累托前),以最小化从天际线的点到所选择的点的最大距离。我们证明了这个问题可以在$O(n\log h)$时间内解决,其中$h$是$P$的天际线中的点数。我们还表明,决策问题可以解决在$O(n\log k)$时间和优化问题可以解决在$O(n \log k + n \operatorname{loglog} n)$时间。这改进了先前的算法,并且对于$k$的大范围值是最佳的。
Effective partitioning method for computing weighted Moore-Penrose inverse
给出了多元多项式矩阵加权Moore-Penrose逆的一种计算方法和算法,并给出了适用于稀疏多项式矩阵的相关算法。这些方法和算法是[M. B. Tasic,P.S.斯塔尼米罗维奇,医学博士Petkovic,加权Moore-Penrose逆的分块法符号计算,应用数学计算。189(2007)615-640]中所描述的方法,以及这些算法在稀疏矩阵上的改进。这些方法也是[P. S. Stanimirovic,M.B.张文,有理矩阵与多项式矩阵的分块方法,应用数学与计算。155(2004)137-163;医学博士Petkovic,P.S. Stanimirovic,使用分区方法的Moore-Penrose逆的符号计算,Internat. J. Comput. Math. 82(2005)355-367]中的方法应用于加权Moore-Penrose逆的情况。算法在符号计算包MATHEMATICA中实现。
加权投票博弈(WVG)是一种联盟博弈,其中代理人对联盟的贡献由他的权重给出,如果联盟的总权重达到或超过给定的配额,则联盟获胜。这些游戏模型的决策,在政治机构以及合作和盈余分割多智能体域。近年来,加权投票博弈的各种解概念的计算复杂性受到了广泛的关注。特别是,Elkind et al.(2007)研究了WVG中与稳定性相关的解决方案概念的复杂性,即核心,最小核心和核仁。虽然他们已经完全描述了核心和最小核心的算法复杂性,但对于核仁,他们只提供了NP-硬度结果。在本文中,我们解决了Elkind等人提出的一个公开问题。通过证明WVG的核仁,以及更一般地,具有固定k的k-向量加权投票游戏,可以在伪多项式时间内计算,即,存在一种算法,其正确地计算核仁并且在玩家数量和最大权重的时间多项式中运行。在这样做的时候,我们提出了一个计算核仁,这可能是适用于更广泛的一类游戏的一般框架。