The problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No...
详细信息
We study the problem of allocating items to agents such that the (un)weighted Nash social welfare (NSW) is maximized under submodular valuations. The best-known results for unweighted and weighted problems are the (4 ...
详细信息
Dynamic graph algorithms have seen significant theoretical advancements, but practical evaluations often lag behind. This work bridges the gap between theory and practice by engineering and empirically evaluating rece...
详细信息
The Fixed Charge Transportation (FCT) problem models transportation scenarios where we need to send a commodity from n sources to m sinks, and the cost of sending a commodity from a source to a sink consists of a line...
详细信息
Given an approximation algorithm A, we want to find the input with the worst approximation ratio, i.e., the input for which A’s output’s objective value is the worst possible compared to the optimal solution’s obje...
详细信息
We study the three-dimensional Knapsack (3DK) problem, in which we are given a set of axis-aligned cuboids with associated profits and an axis-aligned cube knapsack. The objective is to find a non-overlapping axis-ali...
详细信息
We study parameterized and approximation algorithms for a variant of Set Cover, where the universe of elements to be covered consists of points in the plane and the sets with which the points should be covered are seg...
详细信息
We study three fundamental three-dimensional (3D) geometric packing problems: 3D (Geometric) Bin Packing (3d-bp), 3D Strip Packing (3d-sp), and Minimum Volume Bounding Box (3d-mvbb), where given a set of 3D (rectangul...
详细信息
We address the problem on uniform parallel batch machines to minimize makespan where each job is restricted to a specific subset of machines, known as its processing set. Batch machines have diverse speeds and capacit...
详细信息
ISBN:
(数字)9798350361445
ISBN:
(纸本)9798350361452
We address the problem on uniform parallel batch machines to minimize makespan where each job is restricted to a specific subset of machines, known as its processing set. Batch machines have diverse speeds and capacities. Each batch machine has the ability to concurrently process multiple jobs as long as the capacity allows. The length of a batch is defined as the largest length of all the jobs contained within it. We present fast approximation algorithms for inclusive processing set.
We present improved approximation algorithms for some problems in the related areas of Flexible Graph Connectivity and Capacitated Network Design. In the (p, q)-Flexible Graph Connectivity problem, denoted (p, q)-FGC,...
详细信息
暂无评论