Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Guarantees for Packing and Covering Integer Programs
SIAM Journal on Computing
Approximation algorithms
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Winner Determination Algorithms for Electronic Auctions: A Framework Design
EC-WEB '02 Proceedings of the Third International Conference on E-Commerce and Web Technologies
Tight Approximation Results for General Covering Integer Programs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Advances in Engineering Software
Effective bidding and deal identification for negotiations in highly nonlinear scenarios
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Hard multidimensional multiple choice knapsack problems, an empirical study
Computers and Operations Research
Multi-issue negotiation protocol for agents: exploring nonlinear utility spaces
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
There is no EPTAS for two-dimensional knapsack
Information Processing Letters
Development of core to solve the multidimensional multiple-choice knapsack problem
Computers and Industrial Engineering
Electronic Commerce Research and Applications
Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 5.23 |
We consider the problem of splitting an order for R goods, R=1, among a set of sellers, each having bounded amounts of the goods, so as to minimize the total cost of the deal. In deal splitting with packages (DSP), the sellers offer packages containing combinations of the goods; in deal splitting with price tables (DST), the buyer can generate such combinations using price tables. Our problems, which often occur in online reverse auctions, generalize covering integer programs with multiplicity constraints (CIP), where we must fill up an R-dimensional bin by selecting (with a bounded number of repetitions) from a set of R-dimensional items, such that the overall cost is minimized. Thus, both DSP and DST are NP-hard, already for a single good, and hard to approximate for arbitrary number of goods. In this paper we focus on finding efficient approximations for DSP and DST instances where the number of goods is some fixed constant. In particular, we develop polynomial time approximation schemes (PTAS) for several subclasses of instances of practical interest. Our results include a PTAS for CIP in fixed dimension, and a more efficient (combinatorial) scheme for CIP"~, where the multiplicity constraints are omitted. Our approximation scheme for CIP"~ is based on a non-trivial application of the fast scheme for the fractional covering problem, proposed by Fleischer [L. Fleischer, A fast approximation scheme for fractional covering problems with variable upper bounds, in: Proc. of the 15th ACM-SIAM Symposium on Discrete Algorithm, 2004, pp. 994-1003].