找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms and Complexity; 4th Italian Conferen Giancarlo Bongiovanni,Rossella Petreschi,Giorgio G Conference proceedings 2000 Springer-Ver

[复制链接]
查看: 8354|回复: 61
发表于 2025-3-21 19:44:04 | 显示全部楼层 |阅读模式
期刊全称Algorithms and Complexity
期刊简称4th Italian Conferen
影响因子2023Giancarlo Bongiovanni,Rossella Petreschi,Giorgio G
视频video
发行地址Includes supplementary material:
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Algorithms and Complexity; 4th Italian Conferen Giancarlo Bongiovanni,Rossella Petreschi,Giorgio G Conference proceedings 2000 Springer-Ver
影响因子The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invita
Pindex Conference proceedings 2000
The information of publication is updating

书目名称Algorithms and Complexity影响因子(影响力)




书目名称Algorithms and Complexity影响因子(影响力)学科排名




书目名称Algorithms and Complexity网络公开度




书目名称Algorithms and Complexity网络公开度学科排名




书目名称Algorithms and Complexity被引频次




书目名称Algorithms and Complexity被引频次学科排名




书目名称Algorithms and Complexity年度引用




书目名称Algorithms and Complexity年度引用学科排名




书目名称Algorithms and Complexity读者反馈




书目名称Algorithms and Complexity读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:21:58 | 显示全部楼层
发表于 2025-3-22 04:05:41 | 显示全部楼层
Algorithms for a Simple Point Placement Problemen many pairs of them, estimate the relative positions of the points. Problems of this flavor arise in a variety of contexts. The particular motivating example that inspired this work comes from molecular biology; the points are markers on a chromosome and the goal is to map their positions. The pro
发表于 2025-3-22 06:06:55 | 显示全部楼层
发表于 2025-3-22 10:18:19 | 显示全部楼层
Online Strategies for Backupsaults are rare, i.e. the cost of work between two faults is typically large compared to the cost of one backup. Instead of the (worst- case) competitive ratio we use a refined and more expressive quality measure, in terms of the average fault frequency. This is not standard in the online algorithm l
发表于 2025-3-22 16:49:08 | 显示全部楼层
发表于 2025-3-22 20:16:13 | 显示全部楼层
发表于 2025-3-23 00:46:00 | 显示全部楼层
The Hardness of Placing Street Names in a Manhattan Type Mapof maps from a growing and altering set of data. We will show that the problem of placing street names without conflicts in a rectangular grid of streets is NP-complete and APX-hard. This is the first result of this type in this area. Further importance of this result arises from the fact that the c
发表于 2025-3-23 03:55:25 | 显示全部楼层
发表于 2025-3-23 07:21:33 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-25 03:43
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表