ARTÍCULO
TITULO

An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection

Hassin    
R. Levin    
A.    

Resumen

No disponible

 Artículos similares

       
 
Yongseok Lee, Jonghee Youn, Kevin Nam, Hyunyoung Oh and Yunheung Paek    
This paper focuses on enhancing the performance of the Nth-degree truncated-polynomial ring units key encapsulation mechanism (NTRU-KEM) algorithm, which ensures post-quantum resistance in the field of key establishment cryptography. The NTRU-KEM, while ... ver más
Revista: Computers

 
Peter Juma Ochieng, Zoltán Maróti, József Dombi, Miklós Krész, József Békési and Tibor Kalmár    
Copy number variation (CNV) is a form of structural variation in the human genome that provides medical insight into complex human diseases; while whole-genome sequencing is becoming more affordable, whole-exome sequencing (WES) remains an important tool... ver más
Revista: Information

 
Jiajian Tang, Zhenfu Cao, Jiachen Shen and Xiaolei Dong    
With the development of privacy-preserving techniques, the increasing demand for secure multiparty computation (MPC) of mobile devices has become a significant challenge. Unfortunately, it is inapplicable for mobile devices to implement the existing secu... ver más
Revista: Applied Sciences

 
Patcharin Buayen and Jeeraporn Werapun    
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, ... ver más
Revista: Algorithms

 
Mohammad W. Alomari and Christophe Chesneau    
In this work, some new inequalities for the numerical radius of block n-by-n matrices are presented. As an application, the bounding of zeros of polynomials using the Frobenius companion matrix partitioned by the Cartesian decomposition method is proved.... ver más
Revista: Algorithms