New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximation algorithms for min-sum p-clustering
Discrete Applied Mathematics
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
The budgeted maximum coverage problem
Information Processing Letters
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Maximum Linear Arrangement
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An approximation algorithm for MAX DICUT with given sizes of parts
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Budgeted Maximum Graph Coverage
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Maximum betweenness centrality: approximability and tractable cases
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Improved approximation algorithms for maximum graph partitioning problems extended abstract
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Coping with interference: from maximum coverage to planning cellular networks
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximating maximum cut with limited unbalance
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Discrete Applied Mathematics
Improved approximation of maximum vertex cover
Operations Research Letters
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper we demonstrate a general method of designing constant-factor approximation algorithms for some discrete optimization problems with cardinality constraints. The core of the method is a simple deterministic ("pipage") procedure of rounding of linear relaxations. By using the method we design a (1-(1-1/k)k)-approximation algorithm for the maximum coverage problem where k is the maximum size of the subsets that are covered, and a 1/2-approximation algorithm for the maximum cut problem with given sizes of parts in the vertex set bipartition. The performance guarantee of the former improves on that of the well-known (1 - e-1)-greedy algorithm due to Cornuejols, Fisher and Nemhauser in each case of bounded k. The latter is, to the best of our knowledge, the first constant-factor algorithm for that version of the maximum cut problem.