找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Experimental and Efficient Algorithms; Second International Klaus Jansen,Marian Margraf,José D. P. Rolim Conference proceedings 2003 Spring

[復(fù)制鏈接]
查看: 32199|回復(fù): 60
樓主
發(fā)表于 2025-3-21 18:27:36 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Experimental and Efficient Algorithms
副標(biāo)題Second International
編輯Klaus Jansen,Marian Margraf,José D. P. Rolim
視頻videohttp://file.papertrans.cn/319/318969/318969.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Experimental and Efficient Algorithms; Second International Klaus Jansen,Marian Margraf,José D. P. Rolim Conference proceedings 2003 Spring
描述.?This book constitutes the refereed proceedings of the Second International Workshop on Experimental and Efficient Algorithms, WEA 2003, held in Ascona, Switzerland in May 2003...The 19 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 40 submissions. The focus of the volume is on applications of efficient algorithms for combinatorial problems..
出版日期Conference proceedings 2003
關(guān)鍵詞algorithmic mathematics; algorithmics; algorithms; combinatorial mathematics; combinatorial optimization
版次1
doihttps://doi.org/10.1007/3-540-44867-5
isbn_softcover978-3-540-40205-3
isbn_ebook978-3-540-44867-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2003
The information of publication is updating

書目名稱Experimental and Efficient Algorithms影響因子(影響力)




書目名稱Experimental and Efficient Algorithms影響因子(影響力)學(xué)科排名




書目名稱Experimental and Efficient Algorithms網(wǎng)絡(luò)公開度




書目名稱Experimental and Efficient Algorithms網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Experimental and Efficient Algorithms被引頻次




書目名稱Experimental and Efficient Algorithms被引頻次學(xué)科排名




書目名稱Experimental and Efficient Algorithms年度引用




書目名稱Experimental and Efficient Algorithms年度引用學(xué)科排名




書目名稱Experimental and Efficient Algorithms讀者反饋




書目名稱Experimental and Efficient Algorithms讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:33:38 | 只看該作者
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/318969.jpg
板凳
發(fā)表于 2025-3-22 00:27:00 | 只看該作者
https://doi.org/10.1007/978-3-662-55540-8We present two theoretically interesting and empirically successful techniques for improving the linear programming approaches, namely graph transformation and local cuts, in the context of the Steiner problem. We show the impact of these techniques on the solution of the largest benchmark instances ever solved.
地板
發(fā)表于 2025-3-22 06:16:30 | 只看該作者
https://doi.org/10.1007/978-3-319-55769-4In this paper an on-line algorithm for the Rectangle Packing Problem is presented. The method is designed to be able to accept or reject incoming boxes to maximize efficiency. We provide a wide computational analysis showing the behavior of the proposed algorithm as well as a comparison with existing off-line heuristics.
5#
發(fā)表于 2025-3-22 11:54:12 | 只看該作者
,Theoretische Analyse der positiven S?ule,The problem to decide whether a graph is 3-colorable is NP-complete. We show that if . is a locally connected graph (neighborhood of each vertex induces a connected graph), then there exists a linear algorithm which either finds a 3-coloring of ., or indicates that such coloring does not exist.
6#
發(fā)表于 2025-3-22 15:13:19 | 只看該作者
Improving Linear Programming Approaches for the Steiner Tree Problem,We present two theoretically interesting and empirically successful techniques for improving the linear programming approaches, namely graph transformation and local cuts, in the context of the Steiner problem. We show the impact of these techniques on the solution of the largest benchmark instances ever solved.
7#
發(fā)表于 2025-3-22 18:48:29 | 只看該作者
8#
發(fā)表于 2025-3-22 21:15:54 | 只看該作者
Linear Algorithm for 3-Coloring of Locally Connected Graphs,The problem to decide whether a graph is 3-colorable is NP-complete. We show that if . is a locally connected graph (neighborhood of each vertex induces a connected graph), then there exists a linear algorithm which either finds a 3-coloring of ., or indicates that such coloring does not exist.
9#
發(fā)表于 2025-3-23 04:28:09 | 只看該作者
Schlussbetrachtungen und Zusammenfassungen, .. We have also implemented and experimentally evaluated the performance of most of the known approximation colouring algorithms for SQPG [., ., ., .]. We compare the quality of the colourings achieved by these algorithms, with the colourings obtained by our algorithms and with the results obtained
10#
發(fā)表于 2025-3-23 05:43:00 | 只看該作者
https://doi.org/10.1007/978-88-470-1100-7uling problem. In such a setting, jobs are characterized by a processing time and a memory size. Every job must be scheduled on one of the . processors so as to minimize the time makespan and the maximum memory occupation per processor simultaneously. We consider four fundamental classes of algorith
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-22 23:51
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
莲花县| 隆德县| 天峨县| 石景山区| 怀柔区| 岗巴县| 札达县| 城步| 同江市| 卢氏县| 静宁县| 曲松县| 平阳县| 云霄县| 瓦房店市| 濮阳市| 肇东市| 城市| 子洲县| 永川市| 两当县| 吉首市| 肇东市| 安多县| 扬中市| 太谷县| 遵义市| 泌阳县| 上虞市| 平利县| 吉林省| 射洪县| 襄垣县| 天门市| 阿图什市| 徐汇区| 三明市| 靖远县| 上杭县| 永兴县| 苍溪县|