Výsledky vyhľadávania - Approximation algorithms for NP-hard problems

k-Anonymization with Minimal Loss of Information Autor 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…”
Získať plný text

A practical approximation algorithm for optimal k-anonymity Autor 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…”
Získať plný text

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

“…Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems…”
Získať plný text

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

Získať plný text

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

Získať plný text

Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints Autor 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…”
Získať plný text

Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence Autor 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…”
Získať plný text

On the hardness of approximating label-cover Autor Dinur, Irit, Safra, Shmuel

“… [Hardness of Approximations, in: Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996, Chapter 10…”
Získať plný text

A Novel Approximation Algorithm for the Shortest Vector Problem Autor 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…”
Získať plný text

Tractable approximation algorithms for the NP-hard problem of growing linear consensus networks Autor 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…”
Získať plný text

On greedy approximation algorithm for the minimum resolving dominating set problem Autor 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…”
Získať plný text

Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization Autor 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…”
Získať plný text

Integral flow decomposition with minimum longest path length Autor 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…”
Získať plný text

An overview on polynomial approximation of NP-hard problems Autor 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…”
Získať plný text

Computing on binary strings Autor 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…”
Získať plný text

Constructing d-Robust Connected Dominating Sets in Wireless Sensor Networks With Unstable Transmission Ranges Autor 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…”
Získať plný text

Iterative Methods in Combinatorial Optimization Autor 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…”
Získať plný text

Approximation Algorithms for Intersection Graphs Autor 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…”
Získať plný text

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms Autor 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…”
Získať plný text

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

“… We show that this problem is NP-hard and analyse its lower bound. As no (α,1)-approximation algorithm with α…”
Získať plný text