Search Results - "polynomial-time approximation algorithms"

A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme by Saller, Sophia, Koehler, Jana, Karrenbauer, Andreas

“…The traveling salesman (or salesperson) problem, short TSP, is of strong interest to many researchers from mathematics, economics, and computer science…”
Get full text

On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks by Zhang, Shurong, Chen, Lin, Yang, Weihua

“…In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the…”
Get full text

A Fast and Accurate Failure Frequency Approximation for k -Terminal Reliability Systems by Heidarzadeh, Anoosheh, Sprintson, Alex, Singh, Chanan

“…This paper considers the problem of approximating the failure frequency of large-scale composite <inline-formula> <tex-math…”
Get full text

Near optimal multiple alignment within a band in polynomial time by Ma, Bin, Wang, Lusheng, Li, Ming

“…Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band…”
Get full text

SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES by YUAN, JINJIANG, SHI, LEI, OU, JINWEN

“…We consider a non-preemptive single machine scheduling problem with forbidden intervals. Associated with each job is a given processing time and a delivery…”
Get full text

Algorithms for a Variant of the Full Steiner Tree Problem by Wang, Haiyan, Huang, Binchao, Li, Jianping

“…This paper studies a variant of the Steiner tree problem in the Euclidean plane ℝ 2 : the minimum-number of a specific material for the full Steiner tree…”
Get full text

Packing k-edge trees in graphs of restricted vertex degrees by Kelmans, A.K.

“…Let ${\cal G}^{s}_{r}$ denote the set of graphs with each vertex of degree at least r and at most s, v(G) the number of vertices, and τk (G) the maximum number…”
Get full text

Minimum Congestion Redundant Assignments to Tolerate Random Faults by FOTAKIS, D. A, SPIRAKIS, P. G

Get full text

On approximating the memory-Constrained Module Allocation Problem by Roupin, Frédéric

“…In this paper, we consider a variant of the module allocation problem in a distributed system, where processors have limited memory (memory-Constrained Module…”
Get full text

An approximation algorithm for the via placement problem by Gonzalez, T.F., Kurki-Gowdara, S.

“…The authors consider the via placement problem that arises in multilayer printed circuit board (MPCB) layout systems. It is shown that this problem can be…”
Get full text

A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times by Badri, Hossein, Bahreini, Tayebeh, Grosu, Daniel

“…•A new a parallel randomized approximation algorithm for the non-preemptive single machine scheduling problem with release dates and delivery times.•A…”
Get full text

Control traffic balancing in software defined networks by Lin, Shih-Chun, Wang, Pu, Luo, Min

“…To promise on-line and adaptive traffic engineering in software defined networks (SDNs), the control messages, e.g., the first packet of every new flow and…”
Get full text

A complexity and approximation framework for the maximization scaffolding problem by Chateau, A., Giroudeau, R.

“…We explore in this paper some complexity issues inspired by the contig scaffolding problem in bioinformatics. We focus on the following problem: given an…”
Get full text

A PTAS for the cardinality constrained covering with unit balls by Ghasemi, Taha, Razzazi, Mohammadreza

“…In this paper, we address the cardinality constrained covering with unit balls problem: given a positive integer L and a set of n points in Rd, partition them…”
Get full text

Design and Optimization of Electric Autonomous Vehicles with Renewable Energy Source for Smart Cities by Zhou, Pengzhan, Wang, Cong, Yang, Yuanyuan

“…Electric autonomous vehicles provide a promising solution to the traffic congestion and air pollution problems in future smart cities. Considering intensive…”
Get full text

A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements by Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I., Pyatkin, A. V., Shamardin, Yu. V., Shenmaier, V. V.

“…We analyze the mathematical aspects of the data analysis problem consisting in the search (selection) for a subset of similar elements in a group of objects…”
Get full text

Fast approximation algorithms for job scheduling with processing set restrictions by Huo, Yumei, Leung, Joseph Y.-T.

“…We consider the problem of scheduling n independent jobs on m parallel machines, where the machines differ in their functionality but not in their processing…”
Get full text

Polynomial time approximation algorithms for proportionate open-shop scheduling by Naderi, B., Zandieh, M., Yazdani, M.

“…This paper deals with the presentation of polynomial time (approximation) algorithms for a variant of open‐shop scheduling, where the processing times are only…”
Get full text

2-Approximation algorithm for finding a clique with minimum weight of vertices and edges by Eremin, I. I., Gimadi, E. Kh, Kel’manov, A. V., Pyatkin, A. V., Khachai, M. Yu

“…The problem of finding a minimum clique (with respect to the total weight of its vertices and edges) of fixed size in a complete undirected weighted graph is…”
Get full text

A randomized algorithm for determining dominating sets in graphs of maximum degree five by Khamis, Soheir M., Daoud, Sameh S., Essa, Hanaa A.E.

“…The paper is devoted to demonstrating a randomized algorithm for determining a dominating set in a given graph having a maximum degree of five. The algorithm…”
Get full text