e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling unrelated machines with costs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Improved bicriteria existence theorems for scheduling
Proceedings of the tenth 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
Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Scheduling Unrelated Parallel Machines in Parallel
Computational Optimization and Applications
Approximation algorithms for general parallel task scheduling
Information Processing Letters
Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures
Journal of Heuristics
Reconciling simplicity and realism in parallel disk modelsy
Parallel Computing - Parallel data-intensive algorithms and applications
Priority algorithms for makespan minimization in the subset model
Information Processing Letters
Off-line temporary tasks assignment
Theoretical Computer Science
Scheduling of drilling operations in printed circuit board factory
Computers and Industrial Engineering
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
All-Norm Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
On Constrained Hypergraph Coloring and Scheduling
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Task Distributions on Multiprocessor Systems
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Consistent load balancing via spread minimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Self-adapting software for numerical linear algebra and LAPACK for clusters
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
On-line algorithms for the channel assignment problem in cellular networks
Discrete Applied Mathematics
Cooperative facility location games
Journal of Algorithms - Special issue: SODA 2000
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
(Almost) tight bounds and existence theorems for confluent flows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
All-norm approximation algorithms
Journal of Algorithms
Fairness and load balancing in wireless LANs using association control
Proceedings of the 10th annual international conference on Mobile computing and networking
No-wait scheduling in single-hop multi-channel LANs
Information Processing Letters
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On strip packing With rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Value-maximizing deadline scheduling and its application to animation rendering
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Approximation Algorithms for Scheduling on Multiple Machines
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A robust maximum completion time measure for scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGecom Exchanges
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Self-adapting numerical software (SANS) effort
IBM Journal of Research and Development
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Sublogarithmic approximation for telephone multicast
Journal of Computer and System Sciences
Journal of Algorithms
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
On-line load balancing made simple: Greedy strikes back
Journal of Discrete Algorithms
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Information Processing Letters
Reconfiguration in network of embedded systems: Challenges and adaptive tracking case study
Journal of Embedded Computing - Real-Time and Embedded Computing Systems
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Theoretical Computer Science
Approximation algorithms for multiprocessor scheduling under uncertainty
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity
Proceedings of the 8th ACM conference on Electronic commerce
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
An R || Cmax Quantum Scheduling Algorithm
Quantum Information Processing
A lower bound for scheduling mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fairness and load balancing in wireless LANs using association control
IEEE/ACM Transactions on Networking (TON)
Efficient Load-Balanced Clustering Algorithms for wireless sensor networks
Computer Communications
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Graph balancing: a special case of scheduling unrelated parallel machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximation of the single source k-splittable flow problem
Journal of Discrete Algorithms
Load balancing in large-scale RFID systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Computing correlated equilibria in multi-player games
Journal of the ACM (JACM)
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Santa Claus Meets Hypergraph Matchings
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
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
Deploying Software Components for Performance
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
The Influence of Link Restrictions on (Random) Selfish Routing
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Approximating submodular functions everywhere
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Parameterized approximation scheme for the multiple knapsack problem
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
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
Information Processing Letters
Truthful mechanisms for two-range-values variant of unrelated scheduling
Theoretical Computer Science
MaxMin allocation via degree lower-bounded arborescences
Proceedings of the forty-first annual ACM symposium on Theory of computing
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM (JACM)
Latency Constrained Aggregation in Chain Networks Admits a PTAS
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
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
Complete Complexity Classification of Short Shop Scheduling
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
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
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A note on graph balancing problems with restrictions
Information Processing Letters
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
On 2-Player Randomized Mechanisms for Scheduling
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
No-wait scheduling in single-hop multi-channel LANs
Information Processing Letters
Mechanism design for fractional scheduling on unrelated machines
ACM Transactions on Algorithms (TALG)
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Online load balancing made simple: greedy strikes back
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Improved approximation algorithms for minimum-space advertisement scheduling
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimal cluster association in two-tiered wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Convex combinations of single source unsplittable flows
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved lower bounds for non-utilitarian truthfulness
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Envy-free makespan approximation: extended abstract
Proceedings of the 11th ACM conference on Electronic commerce
Assigning tasks for efficiency in Hadoop: extended abstract
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Size-reduction heuristics for the unrelated parallel machines scheduling problem
Computers and Operations Research
Fast approximation algorithms for job scheduling with processing set restrictions
Theoretical Computer Science
A game-theoretic method of fair resource allocation for cloud computing services
The Journal of Supercomputing
Energy efficient scheduling via partial shutdown
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Dynamic scheduling for heterogeneous Desktop Grids
Journal of Parallel and Distributed Computing
Algorithms and theory of computation handbook
Approximation algorithms for min-max generalization problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Computers and Operations Research
A novel resource-driven job allocation scheme for desktop grid environments
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Improved lower bounds for non-utilitarian truthfulness
Theoretical Computer Science
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Discrete Applied Mathematics
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Journal of Intelligent Manufacturing
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science
Santa Claus schedules jobs on unrelated machines
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online scheduling of two job types on a set of multipurpose machines with unit processing times
Computers and Operations Research
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Scheduling unit length jobs on parallel machines with lookahead information
Journal of Scheduling
Capacitated vehicle routing with non-uniform speeds
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Approximation algorithms for unrelated machine scheduling with an energy budget
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Scheduling jobs on heterogeneous platforms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On the configuration-LP for scheduling on unrelated machines
ESA'11 Proceedings of the 19th European conference on Algorithms
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Online Optimization with Uncertain Information
ACM Transactions on Algorithms (TALG)
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Scheduling unrelated parallel machines computational results
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Online scheduling on parallel machines with two gos levels
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Scheduling parallel jobs with linear speedup
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Coordination mechanisms for selfish scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On load-balanced semi-matchings for weighted bipartite graphs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Unrelated parallel machine scheduling with resource dependent processing times
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Scheduling on unrelated machines under tree-like precedence constraints
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On the load-balanced demand points assignment problem in large-scale wireless LANs
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multicriteria global minimum cuts
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
On worst-case allocations in the presence of indivisible goods
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Computers and Operations Research
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
Santa claus meets hypergraph matchings
ACM Transactions on Algorithms (TALG)
Scheduling jobs on identical and uniform processors revisited
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Unrelated parallel machine scheduling using local search
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Parallel machine scheduling with nested job assignment restrictions
Operations Research Letters
Geometric quadrisection in linear time, with application to VLSI placement
Discrete Optimization
Operations Research Letters
A comment on scheduling on uniform machines under chain-type precedence constraints
Operations Research Letters
An optimal rounding gives a better approximation for scheduling unrelated machines
Operations Research Letters
Minimizing flow time on a constant number of machines with preemption
Operations Research Letters
A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A Complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling
Envy-Free Makespan Approximation
SIAM Journal on Computing
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing
Stochastic vehicle routing with recourse
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Assigning sporadic tasks to unrelated parallel machines
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Quasi-polynomial local search for restricted max-min fair allocation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Proactive data dissemination to mission sites
Wireless Networks
A lower bound of 1 + ϕ for truthful scheduling mechanisms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Mechanism design for fractional scheduling on unrelated machines
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The 2-valued case of makespan minimization with assignment constraints
Information Processing Letters
Preemptive coordination mechanisms for unrelated machines
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
RETRAiN: a REcommendation tool for reconfiguration of retail bank branch
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Group activity selection problem
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Tight lower bounds on envy-free makespan approximation
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Choosy: max-min fair sharing for datacenter jobs with constraints
Proceedings of the 8th ACM European Conference on Computer Systems
Leveraging endpoint flexibility in data-intensive clusters
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Computational Optimization and Applications
Upper and lower degree bounded graph orientation with minimum penalty
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Joint cache partition and job assignment on multi-core processors
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
A (2+ε)-approximation for scheduling parallel jobs in platforms
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Energy-Aware Scheduling on Multicore Heterogeneous Grid Computing Systems
Journal of Grid Computing
Methods to explore design space for MPEG RMC codec specifications
Image Communication
Moderately exponential approximation for makespan minimization on related machines
Theoretical Computer Science
Matching with sizes (or scheduling with processing set restrictions)
Discrete Applied Mathematics
Annals of Mathematics and Artificial Intelligence
Task assignment algorithms for two-type heterogeneous multiprocessors
Real-Time Systems
| Hi-index | 0.01 |