Polynomial Time Approximation Scheme Research Articles

Packing squares independently

Given a set of squares and a strip with bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are packed into independent cells separated by horizontal and vertical partitions. For the SIPP, we first investigate efficient solution representations and propose a compact representation that reduces the search space from Ω(n!) to O(2n), with n the number of given squares, while guaranteeing that there exists a solution representation that corresponds to an optimal solution. Based on the solution representation, we show that the problem is NP-hard. To solve the SIPP, we propose a dynamic programming method that can be extended to a fully polynomial-time approximation scheme (FPTAS). We also propose three mathematical programming formulations based on different solution representations and confirm their performance through computational experiments with a mathematical programming solver. Finally, we discuss several extensions that are relevant to practical applications.

Algorithms for the thief orienteering problem on directed acyclic graphs

We consider the scenario of routing an agent called a thief through a weighted graph G=(V,E) from a start vertex s to an end vertex t. A set I of items each with weight wi and profit pi is distributed among V∖{s,t}. The thief, who has a knapsack of capacity W, must follow a simple path from s to t within a given time T while packing in the knapsack a set of items taken from the vertices along the path of total weight at most W and maximum profit. The travel time across an edge depends on the edge length and current knapsack load.The thief orienteering problem (ThOP) is a generalization of the orienteering problem, the longest path problem, and the 0-1 knapsack problem. We prove that there exists no approximation algorithm for ThOP with constant approximation ratio unless P=NP, and we present a polynomial-time approximation scheme (PTAS) for a relaxed version of ThOP when G is directed and acyclic that produces solutions that use time at most T(1+ϵ) for any constant ϵ>0. We also present a fully polynomial-time approximation scheme (FPTAS) for ThOP on arbitrary undirected graphs where the travel time depends only on the lengths of the edges and T is the length of a shortest path from s to t plus a constant K. Finally, we present a FPTAS for a restricted version of the problem where the input graph is a clique.

Truthful mechanism for joint resource allocation and task offloading in mobile edge computing

In the context of mobile edge computing (MEC), the delay-sensitive tasks can achieve real-time data processing and analysis by offloading to the MEC servers. The objective is maximizing social welfare in an auction-based model. However, the distances between mobile devices and access points lead to differences in energy consumption. Unfortunately, existing works have not considered both maximizing social welfare and minimizing energy consumption. Motivated by this, we address the problem of joint resource allocation and task offloading in MEC, with heterogeneous MEC servers providing multiple types of resources for mobile devices (MDs) to perform tasks remotely. We split the problem into two sub-problems: winner determination and offloading decision. The first sub-problem determines winners granted the ability to offload tasks to maximize social welfare. The second sub-problem determines how to offload tasks among the MEC servers to minimize energy consumption. In the winner determination problem, we propose a truthful algorithm that drives the system into equilibrium. We then show the approximate ratios for single and multiple MEC servers. In the offloading decision problem, we propose an approximation algorithm. We then show it is a polynomial-time approximation scheme for a single MEC server. Experiment results show that our proposed mechanism finds high-quality solutions in changing mobile environments.

Efficient polynomial-time approximation scheme for the genus of dense graphs

The main results of this paper provide an Efficient Polynomial-Time Approximation Scheme (EPTAS) for approximating the genus (and non-orientable genus) of dense graphs. By dense we mean that | E ( G )| ≥ α | V ( G )| 2 for some fixed α > 0. While a constant-factor approximation is trivial for this class of graphs, approximations with factor arbitrarily close to 1 need a sophisticated algorithm and complicated mathematical justification. More precisely, we provide an algorithm that for a given (dense) graph G of order n and given ε > 0, returns an integer g such that G has an embedding in a surface of genus g , and this is ε-close to a minimum genus embedding in the sense that the minimum genus \(\mathsf {g}(G) \) of G satisfies: \(\mathsf {g}(G)\le g\le (1+\varepsilon)\mathsf {g}(G) \) . The running time of the algorithm is O ( f (ε) n 2 ), where f (·) is an explicit function. Next, we extend this algorithm to also output an embedding (rotation system) whose genus is g . This second algorithm is an Efficient Polynomial-time Randomized Approximation Scheme (EPRAS) and runs in time O ( f 1 (ε) n 2 ). Our algorithms are based on the analysis of minimum genus embeddings of quasirandom graphs. We use a general notion of quasirandom graphs [25]. We start with a regular partition obtained via an algorithmic version of the Szemerédi Regularity Lemma (due to Frieze and Kannan [17] and to Fox, Lovász, and Zhao [14, 15]). We then partition the input graph into a bounded number of quasirandom subgraphs, which are preselected in such a way that they admit embeddings using as many triangles and quadrangles as faces as possible. Here we provide an ε-approximation ν ( G ) for the maximum number of edge-disjoint triangles in G . The value ν ( G ) can be computed by solving a linear program whose size is bounded by certain value f 2 (ε) depending only on ε. After solving the linear program, the genus can be approximated (see Corollary). The proof of this result is long and will be of independent interest in topological graph theory.

Envy-Free Division of Multilayered Cakes

Dividing a multilayered cake under nonoverlapping constraints captures several scenarios (e.g., allocating multiple facilities over time where each agent can utilize at most one facility simultaneously). We establish the existence of an envy-free multidivision that is nonoverlapping and contiguous within each layer when the number of agents is a prime power, solving partially an open question by Hosseini et al. [Hosseini H, Igarashi A, Searns A (2020) Fair division of time: Multi-layered cake cutting. Proc. 29th Internat. Joint Conf. Artificial Intelligence (IJCAI), 182–188; Hosseini H, Igarashi A, Searns A (2020) Fair division of time: Multi-layered cake cutting. Preprint, submitted April 28, http://arxiv.org/abs/2004.13397 ]. Our approach follows an idea proposed by Jojić et al. [Jojić D, Panina G, Živaljević R (2021) Splitting necklaces, with constraints. SIAM J. Discrete Math. 35(2):1268–1286] for envy-free divisions, relying on a general fixed-point theorem. We further design a fully polynomial-time approximation scheme for the two-layer, three-agent case, with monotone preferences. All results are actually established for divisions among groups of almost the same size. In the one-layer, three-group case, our algorithm is able to deal with any predetermined sizes, still with monotone preferences. For three groups, this provides an algorithmic version of a recent theorem by Segal-Halevi and Suksompong [Segal-Halevi E, Suksompong W (2021) How to cut a cake fairly: A generalization to groups. Amer. Math. Monthly 128(1):79–83]. Funding: This work was partially supported by the Japan Science and Technology Agency [Grant JPMJPR20C], Fusion Oriented REsearch for disruptive Science and Technology [Grant JPMJFR226O], and Exploratory Research for Advanced Technology [Grant JPMJER2301].

A truthful randomized mechanism for task allocation with multi-attributes in mobile edge computing

Mobile Edge Computing (MEC) aims at decreasing the response time and energy consumption of running mobile applications by offloading the tasks of mobile devices (MDs) to the MEC servers located at the edge of the network. The demands are multi-attribute, where the distances between MDs and access points lead to differences in required resources and transmission energy consumption. Unfortunately, the existing works have not considered both task allocation and energy consumption problems. Motivated by this, this paper considers the problem of task allocation with multi-attributes, where the problem consists of the winner determination and offloading decision problems. First, the problem is formulated as the auction-based model to provide flexible service. Then, a randomized mechanism is designed and is truthful in expectation. This drives the system into an equilibrium where no MD has incentives to increase the utility by declaring an untrue value. In addition, an approximation algorithm is proposed to minimize remote energy consumption and is a polynomial-time approximation scheme. Therefore, it achieves a tradeoff between optimality loss and time complexity. Simulation results reveal that the proposed mechanism gets the near-optimal allocation. Furthermore, compared with the baseline methods, the proposed mechanism can effectively increase social welfare and bring higher revenue to edge server providers.

The Continuous-Time Joint Replenishment Problem: ϵ-Optimal Policies via Pairwise Alignment

The main contribution of this paper resides in developing a new algorithmic approach for addressing the continuous-time joint replenishment problem, termed [Formula: see text]-pairwise alignment. The latter mechanism, through which we synchronize multiple economic order quantity models, allows us to devise a purely combinatorial algorithm for efficiently approximating optimal policies within any degree of accuracy. As a result, our work constitutes the first quantitative improvement over power-of-2 policies, which have been state-of-the-art in this context since the mid-1980s. Moreover, in light of recent intractability results, by proposing an efficient polynomial-time approximation scheme for the joint replenishment problem, we resolve the long-standing open question regarding the computational complexity of this classical setting. This paper was accepted by Chung Piaw Teo, optimization. Funding: This work was supported by the Israel Science Foundation [Grant 1407/20].

EXPRESS: Joint Assortment and Price Optimization with Multiple Purchases

In this paper, we incorporate the effects of multi-unit purchases into consumer choice models and investigate the associated joint assortment and pricing problems. Under the proposed two-stage choice framework, consumers first form a consideration set, and then select a product with the optimal quantity from the consideration set to maximize their utility. For the joint assortment and pricing problem with homogeneous consumers, we find that a multi-purchase-willingness-ordered assortment is optimal under certain technical conditions, and propose a polynomial-time algorithm to find the optimal assortment and prices for general cases. We further show that the optimal prices and assortment size are not monotone in multi-purchase preference and multi-purchase resistance. For the joint assortment and pricing problem with heterogeneous consumers, we first prove that this problem is NP-hard. We then consider a scenario with discrete prices and we develop a fully polynomial-time approximation scheme by considering a finite number of consumer segments and nested consideration sets. We conduct an empirical study on the JD.com dataset and show that the new choice framework can improve model fitting and prediction accuracy compared with existing choice models with multiple purchases. We reveal that our model is especially suitable for datasets exhibiting a strong diminishing marginal effect for product variety. We further extend our analysis to price competition and establish the existence and uniqueness of a Nash equilibrium. For the joint optimization with fixed costs, we develop an algorithm that can find a solution guaranteeing at least half the optimal expected profit.

Single machine scheduling with the total weighted late work and rejection cost

AbstractWe study a single machine scheduling problem with the total weighted late work and the total rejection cost. The late work of a job is the part of this job executed after its due date, and the rejection cost of a job is the fee of rejecting to process it. We consider a Pareto scheduling and two restricted scheduling problems. The Pareto scheduling problem aims to find all non‐dominated values of the total weighted late work and the total rejection cost. The restricted scheduling problems are dedicated to minimizing the total weighted late work with the total rejection cost not greater than a given threshold, and minimizing the total rejection cost with the total weighted late work not greater than a given threshold, respectively. For the Pareto scheduling problem, we prove that it is binary NP‐hard by providing a pseudo‐polynomial time algorithm, and give a fully polynomial time approximation scheme (FPTAS). For the restricted scheduling problems, we prove that there are no FPTASes unless , which answers an open problem. Moreover, we develop relaxed FPTASes for these two restricted scheduling problems.

Bounded mixed batch scheduling with job release dates and rejection

This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs that their number does not exceed the machine capacity. For the case with a certain release date, we present a polynomial-time exact algorithm. For the case with a constant number of release dates, a pseudo-polynomial-time exact algorithm is proposed. For the general problem, we provide a 2-approximation algorithm and a polynomial-time approximation scheme.

Minimising the makespan on parallel identical machines with log-linear position-dependent processing times

This article studies the minimum makespan scheduling problem on parallel identical machines with the log-linear learning/ageing effect, also known as polynomial positional learning/ageing effect. To develop a Fully Polynomial Time Approximation Scheme to the problem, we start with an intermediate artificial variant that rounds the values to integers and restricts the solutions to instances sorted in the shortest/longest processing time order. To this end, we propose a dynamic programming algorithm and show that the difference between its returned value and the minimum makespan of the original problem is independent of the processing times. This then leads to an algorithm with provable guaranteed ϵ-additive approximation and pseudo-polynomial running time algorithm, resulting in the desired fully polynomial time approximation solution to the original, not restricted problem.

New Algorithms for Steiner Tree Reoptimization

Reoptimization is a setting in which we are given a good approximate solution of an optimization problem instance and a local modification that slightly changes the instance. The main goal is that of finding a good approximate solution of the modified instance. We investigate one of the most studied scenarios in reoptimization known as Steiner tree reoptimization. Steiner tree reoptimization is a collection of strongly NP\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {NP}$$\\end{document}-hard optimization problems that are defined on top of the classical Steiner tree problem and for which several constant-factor approximation algorithms have been designed in the last decades. In this paper we improve upon all these results by developing a novel technique that allows us to design polynomial-time approximation schemes. Remarkably, prior to this paper, no approximation algorithm better than recomputing a solution from scratch was known for the elusive scenario in which the cost of a single edge decreases. Our results are best possible since none of the problems addressed in this paper admits a fully polynomial-time approximation scheme, unless P=NP\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {P}=\ extsf {NP}$$\\end{document}

A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches

For a transportation line without branches, passenger service scheduling is mainly concerned with the determination of stop schedules for planned service trips. A mixed-integer programming method is proposed to maximize customer satisfaction by minimizing the total number of in-vehicle passengers during trips. A heuristic algorithm is proposed for a given number of service trips, in which the error bound of the heuristic is restricted by the number of stations. When the given number of service trips is sufficient to provide express services for all origin–destination pairs, the heuristic provides an optimal solution. However, the error bound of the heuristic approaches infinity as the number of stations increases. A fully polynomial time-approximation algorithm is proposed, where the number of service trips is a decision variable. Finally, the proposed algorithm was applied to the stop-schedule problem of a river bus operating along the Han River in Seoul, Korea.

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan

We consider a multiobjective scheduling problem, with the aim of minimizing the maximum lateness and the makespan on identical machines, when the number of machines is fixed. This paper proposes an exact algorithm (based on a dynamic programming) to generate the complete Pareto Frontier in a pseudo-polynomial time. Moreover, four heuristics have been proposed in order to optimize our algorithm. Then, we present a Polynomial Time Approximation Scheme (PTAS) to generate an approximate Pareto Frontier. In this scheme, we use a simplification technique based on the merging of jobs. Furthermore, we present a Fully Polynomial Time Approximation Scheme (FPTAS) to generate an approximate Pareto Frontier, based on the conversion of the dynamic programming algorithm. The proposed FPTAS is strongly polynomial. Finally, some numerical experiments are provided in order to compare the proposed approaches.

Affine optimal k-proper connected edge colorings

AbstractWe introduce affine optimalk-proper connected edge colorings as a variation on Fujita’s notion of optimalk-proper connected colorings (Fujita in Optim Lett 14(6):1371–1380, 2020. https://doi.org/10.1007/s11590-019-01442-9) with applications to the frequency assignment problem. Here, for a simple undirected graph G with edge set $$E_G$$ E G , such a coloring corresponds to a decomposition of $$E_G$$ E G into color classes $$C_1, C_2, \ldots , C_n$$ C 1 , C 2 , … , C n , with associated weights $$w_1, w_2, \ldots , w_n$$ w 1 , w 2 , … , w n , minimizing a specified affine function $${\mathcal {A}}\, {:=}\,\sum _{i=1}^{n} \left( w_i \cdot |C_i|\right)$$ A : = ∑ i = 1 n w i · | C i | , while also ensuring the existence of k vertex disjoint proper paths (i.e., simple paths with no two adjacent edges in the same color class) between all pairs of vertices. In this context, we define $$\zeta _{{\mathcal {A}}}^k(G)$$ ζ A k ( G ) as the minimum possible value of $${\mathcal {A}}$$ A under a k-proper connectivity requirement. For any fixed number of color classes, we show that computing $$\zeta _{{\mathcal {A}}}^k(G)$$ ζ A k ( G ) is treewidth fixed parameter tractable. However, we also show that determining $$\zeta _{{\mathcal {A}}^{\prime }}^k(G)$$ ζ A ′ k ( G ) with the affine function $${\mathcal {A}}^{\prime } \, {:=}\,0 \cdot |C_1| + |C_2|$$ A ′ : = 0 · | C 1 | + | C 2 | is NP-hard for 2-connected planar graphs in the case where $$k = 1$$ k = 1 , cubic 3-connected planar graphs for $$k = 2$$ k = 2 , and k-connected graphs $$\forall k \ge 3$$ ∀ k ≥ 3 . We also show that no fully polynomial-time randomized approximation scheme can exist for approximating $$\zeta _{{\mathcal {A}}^{\prime }}^k(G)$$ ζ A ′ k ( G ) under any of the aforementioned constraints unless $$NP=RP$$ N P = R P .

Algorithms for the ferromagnetic Potts model on expanders

AbstractWe give algorithms for approximating the partition function of the ferromagnetic $q$ -color Potts model on graphs of maximum degree $d$ . Our primary contribution is a fully polynomial-time approximation scheme for $d$ -regular graphs with an expansion condition at low temperatures (that is, bounded away from the order-disorder threshold). The expansion condition is much weaker than in previous works; for example, the expansion exhibited by the hypercube suffices. The main improvements come from a significantly sharper analysis of standard polymer models; we use extremal graph theory and applications of Karger’s algorithm to count cuts that may be of independent interest. It is #BIS-hard to approximate the partition function at low temperatures on bounded-degree graphs, so our algorithm can be seen as evidence that hard instances of #BIS are rare. We also obtain efficient algorithms in the Gibbs uniqueness region for bounded-degree graphs. While our high-temperature proof follows more standard polymer model analysis, our result holds in the largest-known range of parameters $d$ and $q$ .

Information Design for Congestion Games with Unknown Demand

We study a novel approach to information design in the standard traffic model of network congestion games. It captures the natural condition that the demand is unknown to the users of the network. A principal (e.g., a mobility service) commits to a signaling strategy, observes the realized demand and sends a (public) signal to agents (i.e., users of the network). Based on the induced belief about the demand, the users then form an equilibrium. We consider the algorithmic goal of the principal: Compute a signaling scheme that minimizes the expected total cost of the induced equilibrium. We concentrate on single-commodity networks and affine cost functions, for which we obtain the following results. First, we devise a fully polynomial-time approximation scheme (FPTAS) for the case that the demand can only take two values. It relies on several structural properties of the cost of the induced equilibrium as a function of the updated belief about the distribution of demands. We show that this function is piecewise linear for any number of demands, and monotonic for two demands. Second, we give a complete characterization of the graph structures for which it is optimal to fully reveal the information about the realized demand. This signaling scheme turns out to be optimal for all cost functions and probability distributions over demands if and only if the graph is series-parallel. Third, we propose an algorithm that computes the optimal signaling scheme for any number of demands whose time complexity is polynomial in the number of supports that occur in a Wardrop equilibrium for some demand. Finally, we conduct a computational study that tests this algorithm on real-world instances.

Approximation Scheme for Weighted Metric Clustering via Sherali-Adams

Motivated by applications to classification problems on metric data, we study Weighted Metric Clustering problem: given a metric d over n points and a k x k symmetric matrix A with non-negative entries, the goal is to find a k-partition of these points into clusters C1,...,Ck, while minimizing the sum of A[i,j] * d(u,v) over all pairs of clusters Ci and Cj and all pairs of points u from Ci and v from Cj. Specific choices of A lead to Weighted Metric Clustering capturing well-studied graph partitioning problems in metric spaces, such as Min-Uncut, Min-k-Sum, Min-k-Cut, and more. Our main result is that Weighted Metric Clustering admits a polynomial-time approximation scheme (PTAS). Our algorithm handles all the above problems using the Sherali-Adams linear programming relaxation. This subsumes several prior works, unifies many of the techniques for various metric clustering objectives, and yields a PTAS for several new problems, including metric clustering on manifolds and a new family of hierarchical clustering objectives. Our experiments on the hierarchical clustering objective show that it better captures the ground-truth structural information compared to the popular Dasgupta's objective.

Competition among Pairwise Lottery Contests

We investigate a two-stage competitive model involving multiple contests. In this model, each contest designer chooses two participants from a pool of candidate contestants and determines the biases. Contestants strategically distribute their efforts across various contests within their budget. We first show the existence of a pure strategy Nash equilibrium (PNE) for the contestants, and propose a fully polynomial-time approximation scheme to compute an approximate PNE. In the scenario where designers simultaneously decide the participants and biases, the subgame perfect equilibrium (SPE) may not exist. Nonetheless, when designers' decisions are made in two substages, the existence of SPE is established. In the scenario where designers can hold multiple contests, we show that the SPE always exists under mild conditions and can be computed efficiently.

The Near Exact Bin Covering Problem

AbstractWe present a new generalization of the bin covering problem that is known to be a strongly NP-hard problem. In our generalization there is a positive constant $$\varDelta $$ Δ , and we are given a set of items each of which has a positive size. We would like to find a partition of the items into bins. We say that a bin is near exact covered if the total size of items packed into the bin is between 1 and $$1+\varDelta $$ 1 + Δ . Our goal is to maximize the number of near exact covered bins. If $$\varDelta =0$$ Δ = 0 or $$\varDelta >0$$ Δ > 0 is given as part of the input, our problem is shown here to have no approximation algorithm with a bounded asymptotic approximation ratio (assuming that $$P\ne NP$$ P ≠ N P ). However, for the case where $$\varDelta >0$$ Δ > 0 is seen as a constant, we present an asymptotic fully polynomial time approximation scheme (AFPTAS) that is our main contribution.