Suchergebnisse - "Approximation algorithms for NP-hard problems"

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

“… The technique of k -anonymization allows the releasing of databases that contain personal information while ensuring some degree of individual privacy …”
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. A wide class of random graph ensembles characterized …”
Volltext

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

“… k -Anonymity is a privacy preserving method for limiting disclosure of private information in data mining. The process of anonymizing a database table …”
Volltext

Methods for task allocation via agent coalition formation von Shehory, Onn, Kraus, Sarit

“… Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we …”
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

The inverse protein folding problem on 2D and 3D lattices von Berman, Piotr, DasGupta, Bhaskar, Mubayi, Dhruv, Sloan, Robert, Turán, György, Zhang, Yi

“… In this paper we investigate the inverse protein folding (IPF) problem under the Canonical model on 3D and 2D lattices [W.E. Hart, On the computational …”
Volltext

An FPTAS for SM-CELS problem with monotone cost functions von Xu, Jianteng, Zhang, Qingpu, Bai, Qingguo

“… Purpose - The purpose of this paper is to find the best approximation algorithm for solving the more general case of single-supplier multi-retailer capacitated …”
Volltext

A note on the Greedy algorithm for finding independent sets of C k -free graphs von Koura, Ippei, Ono, Takao, Hirata, Tomio

“… : Set cover, vertex cover, independent set, and related problems, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1997, pp …”
Volltext

A note on the Greedy algorithm for finding independent sets of C^sub k^-free graphs von Koura, Ippei, Ono, Takao, Hirata, Tomio

“… : Set cover, vertex cover, independent set, and related problems, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1997, pp …”
Volltext

A note on the Greedy algorithm for finding independent sets of Ck-free graphs von KOURA, Ippei, ONO, Takao, HIRATA, Tomio

Volltext

A note on the Greedy algorithm for finding independent sets of -free graphs von Koura, Ippei, Ono, Takao, Hirata, Tomio

Volltext

Generating hard and diverse test sets for NP-hard graph problems von Sanchis, Laura A.

“… In evaluating the performance of approximation algorithms for NP-hard problems, it is often necessary to resort to empirical testing …”
Volltext

Average-case analyses of first fit and random fit bin packing von Albers, Susanne, Mitzenmacher, Michael

“… [“Approximation algorithms for bin backing: A survey,” Approximation algorithms for NP‐hard problems, D. Hochbaum (Editor), PWS, Boston, 1996]. Our proof generalizes …”
Volltext

JGraphT -- A Java library for graph data structures and algorithms von Michail, Dimitrios, Kinable, Joris, Naveh, Barak, Sichi, John V

“… Mathematical software and graph-theoretical algorithmic packages to efficiently model, analyze and query graphs are crucial in an era where large-scale …”
Volltext

George Pólya Winners

“… Professor Frederickson has done research in the area of the design and analysis of algorithms, with major contributions to approximation algorithms for NP-hard problems, graph and network algorithms, and data structures …”
Volltext

Parallel and randomized approximation algorithms for MAXCLIQUE and MAXCUT and their applications von Peinado, Marcus

“… The work in this thesis lies at the confluence of several areas of computer science, most importantly, the analysis of randomized approximation algorithms for NP-hard problems, parallel computation …”
Volltext