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

忠誠(chéng)

書目名稱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é)科排名

錫箔紙

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/318969.jpg

一大群

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.

Synovial-Fluid

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.

發(fā)電機(jī)

,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.

SHRIK

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.

SHRIK

ABASH

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.

盟軍

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

stressors

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