Suchergebnisse - NP-hard approximation algorithm

Efficient Load-Balanced Clustering Algorithms for wireless sensor networks von Low, Chor Ping, Fang, Can, Ng, Jim Mee, Ang, Yew Hock

“… Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic …”
Volltext

Parallel machine scheduling with nested processing set restrictions von Huo, Yumei, Leung, Joseph Y.-T.

“… Preemption is not allowed. Our goal is to minimize the makespan. It is known that the problem is strongly NP-hard and that there is a list-type algorithm with a worst-case bound of 2 - 1 / m …”
Volltext

Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints von Zhang, An, Zhang, Liang, Chen, Yong, Chen, Guangting, Wang, Xing

“… Then we show that the tight approximation ratios of the algorithm are 74 and 53 for two subproblems which remain strongly NP-hard …”
Volltext

A practical approximation algorithm for optimal k-anonymity von Kenig, Batya, Tassa, Tamir

“… The problem of k -anonymization with minimal loss of information is NP-hard. We present a practical approximation algorithm that enables solving the k -anonymization problem with an approximation guarantee of O (ln k …”
Volltext

k-Anonymization with Minimal Loss of Information von Gionis, A., Tassa, T.

“… We study the problem of achieving k -anonymity with minimal loss of information. We prove that it is NP-hard and study polynomial approximations for the optimal solution …”
Volltext

Typical Performance of Approximation Algorithms for NP-hard Problems von Takabe, Satoshi, Hukushima, Koji

“… Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems …”
Volltext

Polynomial time approximation schemes for some dense instances of NP-hard optimization problems: Approximation Algorithms for Combinatorial Optimization Problems von KARPINSKI, M

Volltext

An extended analysis of approximation algorithms for k-median problems on complex networks von Pozo, Roldan

“… While known to be computationally challenging (NP-hard), several approximation algorithms have been proposed, most with high-order polynomial-time complexity …”
Volltext

Tractable approximation algorithms for the NP-hard problem of growing linear consensus networks von Siami, Milad, Motee, Nader

“… This network synthesis problem can be equivalently formulated as an optimization problem over a set of candidate graphs, which is inherently combinatorial and NP-hard …”
Volltext

Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence von Kel'manov, Alexander

“… We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms …”
Volltext

On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems: Approximation and Online Algorithms von UMA, R. N, WEIN, Joel, WILLIAMSON, David P

Volltext

Computing on binary strings von Bu, Tian-Ming, Yuan, Chen, Zhang, Peng

“… In this paper, an O(m2n) algorithm is presented to determine whether a string s is representable by a set W, where n is the number of strings in W and each string has the same length m …”
Volltext

A Novel Approximation Algorithm for the Shortest Vector Problem von Ajitha Shenoy, K. B.

“… Finding the shortest vector in a lattice is a NP-hard problem. The best known approximation algorithm for this problem is LLL algorithm with the approximation …”
Volltext

Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks von Yuan, Dingwen, Lin, Hsuan-Yin, Widmer, Jorg, Hollick, Matthias

“… The characteristics of mmWave communication mandates new paradigms for routing and scheduling. The paper investigates scheduling algorithms under different interference models …”
Volltext

Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization von Srivastava, Vaibhav, Bullo, Francesco

“… •Approximation algorithm for bin-packing problem with sigmoid utility. We study a class of non-convex optimization problems involving sigmoid functions …”
Volltext

Generalized class cover problem with axis-parallel strips von Mudgal, Apurva, Pandit, Supantha

“… We initiate the study of a generalization of the class cover problem [Cannon and Cowen [1], Bereg et al. [2]] the generalized class cover problem, where we are …”
Volltext

Two-stage production scheduling with an outsourcing option von Lee, Kangbok, Choi, Byung-Cheon

“… ► We consider a two stage production scheduling problem with outsourcing option. ► Each operation can be outsourced with a cost proportional to its processing …”
Volltext

Sorting Permutations by Intergenic Operations von Oliveira, Andre Rodrigues, Jean, Geraldine, Fertin, Guillaume, Brito, Klairton Lima, Dias, Ulisses, Dias, Zanoni

“… Genome Rearrangements are events that affect large stretches of genomes during evolution. Many mathematical models have been used to estimate the evolutionary …”
Volltext

On greedy approximation algorithm for the minimum resolving dominating set problem von Zhong, Hao

“… We prove that the resolving dominating set problem is NP-hard and propose a greedy algorithm with an approximation ratio of ( 1 + 2 ln n …”
Volltext

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms von Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th

“… Using ideas and results from polynomial time approximation and exact computation we design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time …”
Volltext