找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: WALCOM: Algorithms and Computation; 12th International C M. Sohel Rahman,Wing-Kin Sung,Ryuhei Uehara Conference proceedings 2018 Springer I

[复制链接]
楼主: 徽章
发表于 2025-3-28 15:17:12 | 显示全部楼层
发表于 2025-3-28 20:15:06 | 显示全部楼层
Random Popular Matchings with Incomplete Preference Lists,e problem of matching every person with a unique item. A matching . is . if for any other matching ., the number of people who prefer . to . is not less than the number of those who prefer . to .. For given . and ., consider the probability of existence of a popular matching when each person’s prefe
发表于 2025-3-28 23:41:10 | 显示全部楼层
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian parallel identical machines and the second stage consists of a single machine processing jobs in the predefined batches. Motivated by applications where unloading and loading occur when the means of transportation are changed, the processing of the jobs, constituting a batch, can commence only if t
发表于 2025-3-29 05:16:30 | 显示全部楼层
发表于 2025-3-29 08:11:03 | 显示全部楼层
发表于 2025-3-29 13:43:19 | 显示全部楼层
A Note on Online Colouring Problems in Overlap Graphs and Their Complements,e intervals presented in non-decreasing order of the left endpoints. We consider the usual colouring problem as well as .-bounded colouring and the same problems in the complement graph. We also consider the case where at most . intervals of the same colour can include the same element. For these ve
发表于 2025-3-29 16:14:50 | 显示全部楼层
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement,s under the . model. We study the fundamental . problem of repositioning . robots on a plane so that each robot is visible to all others. We assume . under which a robot cannot see another robot if a third robot is positioned between them on the straight line connecting them. We are interested in .
发表于 2025-3-29 20:32:25 | 显示全部楼层
Online Facility Assignment,n an online manner. We must assign customer . to facility . before the next customer . arrives. The cost of this assignment is the distance between . and .. The total number of customers is at most |.|. and each customer must be assigned to a facility. The objective is to minimize the sum of all ass
发表于 2025-3-30 01:29:43 | 显示全部楼层
发表于 2025-3-30 07:45:55 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 07:43
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表