Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On the complexity of local search
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Simple local search problems that are hard to solve
SIAM Journal on Computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
The hardness of approximation: gap location
Computational Complexity
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Domatic Number
SIAM Journal on Computing
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for the partial latin square extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Sequential and Parallel Algorithms for Mixed Packing and Covering
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Distributions on Level-Sets with Applications to Approximation Algorithms
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Market sharing games applied to content distribution in ad-hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for distributed and selfish agents
Approximation algorithms for distributed and selfish agents
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
On maximizing welfare when utility functions are subadditive
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An efficient approximation for the generalized assignment problem
Information Processing Letters
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial allocation mechanism with penalties for banner advertising
Proceedings of the 17th international conference on World Wide Web
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On exploiting diversity and spatial reuse in relay-enabled wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimizing query rewrites for keyword-based advertising
Proceedings of the 9th ACM conference on Electronic commerce
Uncoordinated two-sided matching markets
Proceedings of the 9th ACM conference on Electronic commerce
The Generalized Maximum Coverage Problem
Information Processing Letters
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
Mathematics of Operations Research
On the complexity of nash dynamics and sink equilibria
Proceedings of the 10th ACM conference on Electronic commerce
Dynamic spectrum access in DTV whitespaces: design rules, architecture and algorithms
Proceedings of the 15th annual international conference on Mobile computing and networking
Truthful Mechanisms via Greedy Iterative Packing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Proactive data dissemination to mission sites
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Sensor-mission assignment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Approximating interval scheduling problems with bounded profits
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A unified approach to congestion games and two-sided markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Assigning sensors to missions with demands
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Min sum edge coloring in multigraphs via configuration LP
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Truthful assignment without money
Proceedings of the 11th ACM conference on Electronic commerce
Efficient resource allocation with flexible channel cooperation in OFDMA cognitive radio networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cooperation vs. multiplexing: multicast scheduling algorithms for ofdma relay networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
ACO-GA approach to paper-reviewer assignment problem in CMS
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part II
Budgeted red-blue median and its generalizations
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
Dynamic resource allocation for spot markets in clouds
Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services
Sharing-aware algorithms for virtual machine colocation
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
MOTA: engineering an operator agnostic mobile service
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Scheduling algorithms for multicarrier wireless data systems
IEEE/ACM Transactions on Networking (TON)
Improving user interest inference from social neighbors
Proceedings of the 20th ACM international conference on Information and knowledge management
Uncoordinated Two-Sided Matching Markets
SIAM Journal on Computing
Journal of Discrete Algorithms
Convergence and approximation in potential games
Theoretical Computer Science
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
Design and implementation of an integrated beamformer and uplink scheduler for OFDMA femtocells
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Proactive data dissemination to mission sites
Wireless Networks
A study on the consistency and significance of local features in off-line signature verification
Pattern Recognition Letters
ProBeam: a practical multicell beamforming system for OFDMA small-cell networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, fij, for assigning item j to bin i; and a separate packing constraint for each bin - i.e. for bin i, a family Li of subsets of items that fit in bin i. The goal is to pack items into bins to maximize the aggregate value. This class of problems includes the maximum generalized assignment problem (GAP)1) and a distributed caching problem (DCP) described in this paper.Given a β-approximation algorithm for finding the highest value packing of a single bin, we give1. A polynomial-time LP-rounding based ((1 − 1/e)β)-approximation algorithm.2. A simple polynomial-time local search (β/β+1 - ε) - approximation algorithm, for any ε 0.Therefore, for all examples of SAP that admit an approximation scheme for the single-bin problem, we obtain an LP-based algorithm with (1 - 1/e - ε)-approximation and a local search algorithm with (1/2-ε)-approximation guarantee. Furthermore, for cases in which the subproblem admits a fully polynomial approximation scheme (such as for GAP), the LP-based algorithm analysis can be strengthened to give a guarantee of 1 - 1/e. The best previously known approximation algorithm for GAP is a 1/2-approximation by Shmoys and Tardos; and Chekuri and Khanna. Our LP algorithm is based on rounding a new linear programming relaxation, with a provably better integrality gap.To complement these results, we show that SAP and DCP cannot be approximated within a factor better than 1 -1/e unless NP⊆ DTIME(nO(log log n)), even if there exists a polynomial-time exact algorithm for the single-bin problem.We extend the (1 - 1/e)-approximation algorithm to a nonseparable assignment problem with applications in maximizing revenue for budget-constrained combinatorial auctions and the AdWords assignment problem. We generalize the local search algorithm to yield a 1/2-ε approximation algorithm for the k-median problem with hard capacities. Finally, we study naturally defined game-theoretic versions of these problems, and show that they have price of anarchy of 2. We also prove the existence of cycles of best response moves, and exponentially long best-response paths to (pure or sink) equilibria.