On local search and placement of meters in networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Approximate local search in combinatorial optimization
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Hardness of approximation for non-overlapping local alignments
Discrete Applied Mathematics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Greedy in approximation algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Angle Optimization in Target Tracking
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
On the minimum common integer partition problem
ACM Transactions on Algorithms (TALG)
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Combinatorial Coalition Formation for multi-item group-buying with heterogeneous customers
Decision Support Systems
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Mathematics of Operations Research
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
Journal of Combinatorial Optimization
Assignment problems in rental markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Flow on noisy terrains: an experimental evaluation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
On the minimum common integer partition problem
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
The path partition problem and related problems in bipartite graphs
Operations Research Letters
Local search for the minimum label spanning tree problem with bounded color classes
Operations Research Letters
An improved approximation algorithm for the bandpass problem
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A New Local Search Algorithm for Binary Optimization
INFORMS Journal on Computing
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
Given a collection of sets of cardinality at most k, with weights for each set, the maximum weighted packing problem is that of finding a collection of disjoint sets of maximum total weight. We study the worst case behavior of the t-local search heuristic for this problem proving a tight bound of k - 1 + 1/t . As a consequence, for any given r k -1) we can compute in polynomial time a solution whose weight is at least r times the optimal.,