Approximation algorithms for MAX-MIN tiling

Authors:
Piotr Berman;Bhaskar DasGupta;S. Muthukrishnan
Affiliations:
Department of Computer Science, Pennsylvania State University, University Park, PA;Department of Computer Science, University of Illinois at Chicago, Chicago, IL;AT&T Labs--Research, 180 Park Avenue, Florham Park, NJ
Venue:
Journal of Algorithms
Year:
2003

Citing 6
Cited 3

Mining optimized association rules for numeric attributes

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On approximating rectangle tiling and packing

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Rectangular tiling in multi-dimensional arrays

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for rectangle tiling and packing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation algorithms for tiling and packing problems with rectangles

Journal of Algorithms
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms

SIAM Journal on Discrete Mathematics

The inverse protein folding problem on 2D and 3D lattices

Discrete Applied Mathematics
Approximation algorithms for min-max generalization problems

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Coloring Kk-free intersection graphs of geometric objects in the plane

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the fixed-parameter complexity of WEIGHTED VERTEX COVER. Given a graph G = (V, E), a weight function ω: V → R+, and k ∈ R+, WEIGHTED VERTEX COVER (WVC for short) asks for a vertex subset ...