A packing problem you can almost solve by sitting on your suitcase
SIAM Journal on Algebraic and Discrete Methods
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Processor scheduling with improved heuristic algorithms
Processor scheduling with improved heuristic algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
An optimal upper bound on the minimal completion time in distributed supercomputing
ICS '94 Proceedings of the 8th international conference on Supercomputing
Modeling the benefits of mixed data and task parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
On Exploiting Task Duplication in Parallel Program Scheduling
IEEE Transactions on Parallel and Distributed Systems
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation schemes for scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Preemptive scheduling with job-dependent setup times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximability of scheduling with fixed jobs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Approximation algorithms for extensible bin packing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Scheduling on hierarchical clusters using malleable tasks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Theoretical Computer Science
The freeze-tag problem: how to wake up a swarm of robots
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On scheduling send-graphs and receive-graphs under the LogP-model
Information Processing Letters
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Off-line temporary tasks assignment
Theoretical Computer Science
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Performance Guarantees of Local Search for Multiprocessor Scheduling
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Parallel Applications Using Malleable Tasks on Clusters
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
All-Norm Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Polynominal time approximation schemes for class-constrained packing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Vector Assignment Problems: A General Framework
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Property testing in massive graphs
Handbook of massive data sets
Stochastic Load Balancing and Related Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On variable sized vector packing
Acta Cybernetica
Complexity of min-max subsequence problems
Information Processing Letters
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P|Cmax Problem
Journal of Heuristics
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Vector assignment problems: a general framework
Journal of Algorithms
Approximation schemes for parallel machine scheduling problems with controllable processing times
Computers and Operations Research
How to route and tax selfish unsplittable traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Performance bounds of algorithms for scheduling advertisements on a web page
Journal of Scheduling
All-norm approximation algorithms
Journal of Algorithms
Using the FDH formulation of DEA to evaluate a multi-criteria problem in parallel machine scheduling
Computers and Industrial Engineering
Scheduling Web Advertisements: A Note on the Minspace Problem
Journal of Scheduling
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The effect of machine availability on the worst-case performance of LPT
Discrete Applied Mathematics
Approximation Algorithms for Extensible Bin Packing
Journal of Scheduling
Information Technology and Management
Structure and complexity of extreme Nash equilibria
Theoretical Computer Science - Game theory meets theoretical computer science
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Journal of Algorithms
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
Theoretical Computer Science
Load balancing of temporary tasks in the lp norm
Theoretical Computer Science - Approximation and online algorithms
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Domination analysis for minimum multiprocessor scheduling
Discrete Applied Mathematics
Speed scaling on parallel processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Routing selfish unsplittable traffic
ACM Transactions on Algorithms (TALG)
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Load balancing in large-scale RFID systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Bin packing with controllable item sizes
Information and Computation
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The power of verification for one-parameter agents
Journal of Computer and System Sciences
Scheduling of a single crane in batch annealing process
Computers and Operations Research
Fair cost-sharing methods for scheduling jobs on parallel machines
Journal of Discrete Algorithms
Online Scheduling with Bounded Migration
Mathematics of Operations Research
On-Line Multiple-Strip Packing
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Makespan Minimization with Machine Availability Constraints
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Approximating Scheduling Machines with Capacity Constraints
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Task scheduling in distributed environment using genetic algorithm
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
A sublinear-time approximation scheme for bin packing
Theoretical Computer Science
Minimum deviation algorithm for two-stageno-wait flowshops with parallel machines
Computers & Mathematics with Applications
The effect of machine availability on the worst-case performance of LPT
Discrete Applied Mathematics
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Optimal preemptive scheduling for general target functions
Journal of Computer and System Sciences
Improved approximation algorithms for minimum-space advertisement scheduling
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A framework for designing approximation algorithms for scheduling problems
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Optimal cluster association in two-tiered wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Approximation algorithms for scheduling with reservations
HiPC'07 Proceedings of the 14th international conference on High performance computing
Randomized priority algorithms
Theoretical Computer Science
Minimum weighted sum bin packing
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Approximation schemes for packing splittable items with cardinality constraints
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
Fast approximation algorithms for job scheduling with processing set restrictions
Theoretical Computer Science
Scheduling with bully selfish jobs
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Algorithms and theory of computation handbook
Exact and approximation algorithms for geometric and capacitated set cover problems
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A robust PTAS for machine covering and packing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fully polynomial time approximation schemes for scheduling divisible loads
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Theoretical Computer Science
SIAM Journal on Discrete Mathematics
A cutting plane approach for integrated planning and scheduling
Computers and Operations Research
Interactive hybrid simulation of large-scale traffic
Proceedings of the 2011 SIGGRAPH Asia Conference
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
SIAM Journal on Optimization
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
Approximation schemes for packing with item fragmentation
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Linear time algorithms for parallel machine scheduling
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Fair cost-sharing methods for scheduling jobs on parallel machines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A robust APTAS for the classical bin packing problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Efficient job scheduling algorithms with multi-type contentions
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Bin packing with rejection revisited
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem
Journal of Parallel and Distributed Computing
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
ACM Transactions on Algorithms (TALG)
Approximation algorithms for scheduling and packing problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Scheduling jobs on identical and uniform processors revisited
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Semi-online scheduling revisited
Theoretical Computer Science
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Parallel machine scheduling with nested job assignment restrictions
Operations Research Letters
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Operations Research Letters
Approximation algorithms for the multiprocessor open shop scheduling problem
Operations Research Letters
A tight upper bound for the k-partition problem on ideal sets
Operations Research Letters
Extending Graham's result on scheduling to other heuristics
Operations Research Letters
Scheduling of pipelined operator graphs
Journal of Scheduling
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing
On multiprocessor temperature-aware scheduling problems
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
IEEE/ACM Transactions on Networking (TON)
Combination of parallel machine scheduling and vertex cover
Theoretical Computer Science
Balancing reducer skew in MapReduce workloads using progressive sampling
Proceedings of the Third ACM Symposium on Cloud Computing
Fast asymptotic FPTAS for packing fragmentable items with costs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Task scheduling for parallel multifrontal methods
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Proceedings of the 20th International Conference on Real-Time and Network Systems
On the value of job migration in online makespan minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Partitioned EDF scheduling on a few types of unrelated multiprocessors
Real-Time Systems
Journal of Discrete Algorithms
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Recent advances for a classical scheduling problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Smart-Grid electricity allocation via strip packing with slicing
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Partitioned EDF scheduling: a closer look
Real-Time Systems
Annals of Mathematics and Artificial Intelligence
On multiprocessor temperature-aware scheduling problems
Journal of Scheduling
Hi-index | 0.01 |
The problem of scheduling a set of n jobs on m identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theory of approximation algorithms for NP-hard optimization problems. In this paper the strongest possible type of result for this problem, a polynomial approximation scheme, is presented. More precisely, for each &egr;, an algorithm that runs in time O((n/&egr;)1/&egr;2) and has relative error at most &egr; is given. In addition, more practical algorithms for &egr; = 1/5 + 2-k and &egr; = 1/6 + 2-k, which have running times O(n(k + log n)) and O(n(km4 + log n)) are presented. The techniques of analysis used in proving these results are extremely simple, especially in comparison with the baroque weighting techniques used previously.The scheme is based on a new approach to constructing approximation algorithms, which is called dual approximation algorithms, where the aim is to find superoptimal, but infeasible, solutions, and the performance is measured by the degree of infeasibility allowed. This notion should find wide applicability in its own right and should be considered for any optimization problem where traditional approximation algorithms have been particularly elusive.