Segment routing (SR) combines the advantages of source powered by software-defined networking (SDN) paradigm and hop-by-hop in legacy network infrastructure. The recent applications SR multi-domain service function chaining (SFC) entail efficient use multiple segments. However, because computation inefficiency, it is nearly impossible to accurately evaluate whether what extent various types net...

We propose an efficient Fully Polynomial-Time Approximation Scheme (FPTAS) for stochastic convex dynamic programs using the technique of K-approximation sets and functions introduced by Halman et al. This paper deals with the convex case only, and it has the following contributions: First, we improve on the worst-case running time given by Halman et al. Second, we design an FPTAS with excellent...

Camponogara and Shima (2010) developed an ε-approximation algorithm (FPTAS) for the mobile agent routing problem in which a benefit function determines how visits to different sites contribute to the agent’s mission. The benefit is to be maximized under a time constraint. They reduced the problem to the constrained longest-path problem in a graph. In this note we present a modified FPTAS that i...

We provide the first fully polynomial time approximation scheme (FPTAS) for computing an approximate mixed-strategy Nash equilibrium in tree-structured graphical multi-hypermatrix games (GMhGs). GMhGs are generalizations of normal-form games, graphical games, graphical polymatrix games, and hypergraphical games. Computing an exact mixed-strategy Nash equilibria in graphical polymatrix games is ...

Given a graph with a cost and a delay on each edge, Restricted Shortest Path (RSP) aims to find a min-cost s–t path subject to an end-to-end delay constraint. The problem is NP-hard. In this note we present an FPTAS with an improved running time of O(mn/ε) for acyclic graphs, where m and n denote the number of edges and nodes in the graph. Our algorithm uses a scaling and rounding technique sim...

The problem of minimizing a quadratic function of boolean variables, which we call PHP (positive half-product), is formulated. A fully polynomial time approximation scheme (FPTAS) for PHP is derived. Several NP-hard scheduling problems can be formulated in terms of PHP. In this presentation, we concentrate on a single machine scheduling problem with controllable job processing times to minimize...

We give a fully polynomial time approximation scheme (FPTAS) for the optimum fractional solution to the Steiner forest problem. This can easily be generalized to obtain an FPTAS for a hitting set problem on a collection of clutters. We also identify three other problems on collections of clutters and show how these four problems are related when the clutters have the max-flow min-cut (MFMC) pro...

We consider a setting in which a single divisible good (“cake”) needs to be dividedbetween n players, each with a possibly different valuation function over pieces of thecake. For this setting, we address the problem of finding divisions that maximize thesocial welfare, focusing on divisions where each player needs to get one contiguouspiece of the cake. We show that for both th...

This paper deals with a common due date parallel machines scheduling problem in which each job has a different tardiness penalty. The objective is to minimize the total weighted tardiness. The scheduling problem of minimizing the total weighted tardiness with a common due date on a single machine is known to be ordinary NP-hard. This is also the case for problem Pm|di = d| ∑ wiTi. A new dynamic...