找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: WALCOM: Algorithms and Computation; 15th International C Ryuhei Uehara,Seok-Hee Hong,Subhas C. Nandy Conference proceedings 2021 Springer N

[复制链接]
楼主: otitis-externa
发表于 2025-3-28 15:35:09 | 显示全部楼层
A New Transportation Problem on a Graph with Sending and Bringing-Back Operationsgle round of valid transportations that eliminate all of shortages is our concern. After proving NP-completeness of the problem we present a linear time algorithm for a special case where an input graph is a forest.
发表于 2025-3-28 21:17:56 | 显示全部楼层
A New Transportation Problem on a Graph with Sending and Bringing-Back Operationsgle round of valid transportations that eliminate all of shortages is our concern. After proving NP-completeness of the problem we present a linear time algorithm for a special case where an input graph is a forest.
发表于 2025-3-29 00:44:34 | 显示全部楼层
发表于 2025-3-29 04:25:16 | 显示全部楼层
On Short Fastest Paths in Temporal Graphs..The dominance relation is interesting in its own right, and may be of use for several related problems like fastest paths with minimum fare, fastest paths with minimum number of stops, and other pareto-optimal path problems in temporal graphs.
发表于 2025-3-29 10:22:03 | 显示全部楼层
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights . under . is the sum of arrival times at . for all the people determined by .. The regret for . under . is the gap between the cost of . under . and the optimal cost under .. The task of the problem is formulated as the one to find a sink location that minimizes the maximum regret over all .. For t
发表于 2025-3-29 11:23:22 | 显示全部楼层
发表于 2025-3-29 18:31:15 | 显示全部楼层
The Bike Sharing Probleme end of the interval..Our main result is the construction of a polynomial time algorithm for the Bike Sharing problem that creates an arrival-time optimal schedule for travellers and bikes to travel across the interval. For the Relaxed Bike Sharing problem, we give an algorithm that gives an optima
发表于 2025-3-29 20:38:56 | 显示全部楼层
发表于 2025-3-30 00:39:14 | 显示全部楼层
发表于 2025-3-30 05:26:07 | 显示全部楼层
Efficient Generation of a Card-Based Uniformly Distributed Random Derangementf approximately 0.6. In this study, we consider how to decrease the probability of the need to restart the shuffle based on the aforementioned protocol. Specifically, we prepare more piles of cards than the number . of players. This potentially helps us avoid repeating the shuffle, because we can re
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-4 02:02
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表