Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems
NP-hard problems have numerous applications in various fields such as networks, computer systems, circuit design, etc. However, no efficient algorithms have been found for NP-hard problems. It has been commonly believed that no efficient algorithms for NP-hard problems exist, i.e., that P6=NP. Recen...
Main Author: | Liu, Yang |
---|---|
Other Authors: | Chen, Jianer |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-7010 |
Similar Items
-
On Covering Points with Conics and Strips in the Plane
by: Tiwari, Praveen 1985-
Published: (2013) -
The Parameterized Complexity of the Rainbow Subgraph Problem
by: Falk Hüffner, et al.
Published: (2015-02-01) -
Co-Clustering under the Maximum Norm
by: Laurent Bulteau, et al.
Published: (2016-02-01) -
Caractérisation des instances difficiles de problèmes d'optimisation NP-difficiles
by: Weber, Valentin
Published: (2013) -
A Parameterized Approximation Algorithm for the Chromatic k-Median Problem
by: Zhen Zhang, et al.
Published: (2021-01-01)