Titlebook: SOFSEM 2020: Theory and Practice of Computer Science; 46th International C Alexander Chatzigeorgiou,Riccardo Dondi,Florian Si Conference pr

ABASH

Verify

Approximating Shortest Connected Graph Transformation for Treesof a shortest transformation. In this paper, we show that there exists a 2.5-approximation algorithm running in polynomial time. We also discuss the tightness of the lower bound and show that, in order to drastically improve the approximation ratio, we need to improve the best known lower bounds.

glucagon

Approximating Weighted Completion Time for Order Scheduling with Setup Timesof approximability and provide constant factor approximations as well as an inapproximability result. Prior to this work, only the NP-hardness of the unweighted case and the polynomial solvability of a certain special case were known.

讨厌

不可接触

0302-9743 ea of SOFSEM 2020: foundations of computer science, foundations of data science and engineering, foundations of software engineering, and foundations of algorithmic computational biology..978-3-030-38918-5978-3-030-38919-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

generic

酷热

Sharing Energy for Optimal Edge Performanceks with a product-form solution for the equilibrium probability distribution of system state. The approach can also be used to design energy dispatching systems when renewable energy is used to improve the sustainability of edge computing.

现晕光

贪婪性

Conference proceedings 2020wed and selected from 125 submissions. They presented new research results in the theory and practice of computer science in the each sub-area of SOFSEM 2020: foundations of computer science, foundations of data science and engineering, foundations of software engineering, and foundations of algorithmic computational biology..

syncope