Titlebook: Algorithmic Aspects in Information and Management; 18th International C Smita Ghosh,Zhao Zhang Conference proceedings 2024 The Editor(s) (i

Cytokines

GLOOM

Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable JobsPBMS). Unlike traditional PBMS that considers only fixed job widths, this paper studies generalized PBMS with malleable jobs that allow job width to be changed during the job execution, provided it does not exceed its maximum degree of parallelism. We propose a fast . approximation algorithm by exte

Handedness

神刊

ToI-Based Data Utility Maximization for UAV-Assisted Wireless Sensor Networksr networks. Previous works mainly focus on improving the freshness of the collected data or the energy efficiency by scheduling UAVs. Considering the fact that the sensing data in some applications is time-sensitive, that is, the value of the sensing data is based on its Timeliness of Information (T

肌肉

Parity-Constrained Weighted ,-Center metric space with distances and a non-negative budget .. Additionally, each vertex is associated with a non-negative weight and an odd or even parity requirement. The objective is to select a subset of vertices as open centers and assign each vertex to an open center so as to minimize the maximum d

定点

Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constra, which is called the diameter of .. Given a disconnected road network modelled as two disjoint trees . and ., this paper first aims at inserting one or two edges (bridges) between them to minimize the (constrained) diameter . going through the inserted edges, where ., is the set of inserted edges w

EVEN

吞噬

A Distributed Approximation Algorithm for the Total Dominating Set Problemsent a distributed algorithm for the TDS problem via the LP relaxation techniques. For a positive integer . and maximum degree ., the proposed algorithm outputs a fractional total dominating set of expected size .. The distributed algorithm runs in . communication rounds, and the algorithm use messa

pulse-pressure

candle

or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraintg an or-submodular function under different constraints arises in many applications, and it is NP-hard. In this paper, we utilize a greedy algorithm to get a .-approximation solution for maximizing an or-submodular function under a matroid constraint. Moreover, for maximizing an or-submodular functi