Levin Asaf

Asaf Levin

Information about the author Asaf Levin will soon be added to the site.
Found 14 papers in total
Online Clustering with Variable Sized Clusters
Online Clustering with Variable Sized Clusters
2013
Online clustering problems are problems where the classification of points into sets...
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
2012
We continue the study of bin packing with splittable items and cardinality...
On Equilibria for ADM Minimization Games
On Equilibria for ADM Minimization Games
2012
In the ADM minimization problem the input is a set of arcs along a directed ring. The...
Selfish bin coloring
Selfish bin coloring
2011
The bin packing problem, a classical problem in combinatorial optimization, has...
Weighted sum coloring in batch scheduling of conflicting jobs
Weighted sum coloring in batch scheduling of conflicting jobs
2009
Motivated by applications in batch scheduling of jobs in manufacturing systems and...
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
2008
We study the problem of minimizing total latency in machine scheduling with...
The finite horizon investor problem with a budget constraint
The finite horizon investor problem with a budget constraint
2007
We study a model that incorporates a budget constraint in a decision making problem....
Methodologies and algorithms for group-rankings decision
Methodologies and algorithms for group-rankings decision
2006
The problem of group ranking, also known as rank aggregation, has been studied in...
Synthesis of 2-commodity flow networks
Synthesis of 2-commodity flow networks
2004
We investigate network design under volatile conditions of link failures and traffic...
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such...
Strongly polynomial-time approximation for a class of bicriteria problems
Strongly polynomial-time approximation for a class of bicriteria problems
2004
Consider the following problem: given a ground set and two minimization objectives of...
A better approximation algorithm for the budget prize collecting tree problem
A better approximation algorithm for the budget prize collecting tree problem
2004
Given an undirected graph G=(V,E) , an edge cost c(e)⩾0 for each edge e...
Lexicographic local search and the p-center problem
Lexicographic local search and the p-center problem
2003
We introduce a local search strategy that suits combinatorial optimization problems...
Approximation algorithms for constructing wavelength routing networks
Approximation algorithms for constructing wavelength routing networks
2002
Consider a requirement graph whose vertices represent customers and an edge represents...
Papers per page: