Redirigiendo al acceso original de articulo en 24 segundos...
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

       
 
Yuhang Ma, Jiecheng Du, Tihao Yang, Yayun Shi, Libo Wang and Wei Wang    
Robust optimization design (ROD) is playing an increasingly significant role in aerodynamic shape optimization and aircraft design. However, an efficient ROD framework that couples uncertainty quantification (UQ) and a powerful optimization algorithm for... ver más
Revista: Aerospace

 
Yilei Song, Guolin Ma, Linlin Tian, Ning Zhao and Xiyun Lu    
Wind is one of the main factors raising errors in the spacecraft?s landing phase. As a result, an accurate description of incoming wind conditions is supposed to be a prerequisite for reliable parafoil trajectory planning. This work utilizes the Weather ... ver más
Revista: Aerospace

 
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

 
Xingyu Zhou, Tong Qin and Linzhi Meng    
This paper proposed a polynomial representation-based method for orbit determination (OD) of spacecraft with the unknown maneuver. Different from the conventional maneuvering OD approaches that rely on specific orbit dynamic equation, the proposed method... ver más
Revista: Aerospace