Suchergebnisse - Approximation algorithms for NP-hard problems

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

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

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

Iterative Methods in Combinatorial Optimization von Lau, Lap Chi, Ravi, R., Singh, Mohit

“… With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility …”
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

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

“… The problem without any fixed sequence was previously recognized as weakly NP-hard. In this paper, we first present a 95-approximation algorithm for the problem with a fixed sequence …”
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 hardness of approximating label-cover von Dinur, Irit, Safra, Shmuel

“… [Hardness of Approximations, in: Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996, Chapter 10 …”
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

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

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

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

Integral flow decomposition with minimum longest path length von Pienkosz, Krzysztof, Koltys, Kamil

“… It is shown that this problem is NP-hard in the strong sense. Two approximation algorithms are proposed for the problem …”
Volltext

An overview on polynomial approximation of NP-hard problems von Paschos, Vangelis

“… Among the classes of heuristic methods for NP-hard problems, the polynomial approximation algorithms aim at solving a given NP-hard problem in poly-nomial time by computing feasible solutions …”
Volltext

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

“… Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced …”
Volltext

Constructing d-Robust Connected Dominating Sets in Wireless Sensor Networks With Unstable Transmission Ranges von Liang, Xinyu, Liang, Jiarong, Zhang, Weiguang

“… ) has been proven to be an NP-hard problem. Thus, most researchers use approximation algorithms to find smaller CDSs …”
Volltext

Approximation Algorithms for Intersection Graphs von Kammer, Frank, Tholey, Torsten

“… We study three complexity parameters that, for each vertex v , are an upper bound for the number of cliques that are sufficient to cover a subset S ( v ) of …”
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

The facility location problem with maximum distance constraint von Li, Xiaowei, Lu, Xiwen

“… We show that this problem is NP-hard and analyse its lower bound. As no (α,1)-approximation algorithm with α …”
Volltext