Search Results - "Polynomial time approximation algorithm"

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

A .699-approximation algorithm for Max-Bisection by Ye, Yinyu

Get full text

An \frac-Approximation Algorithm for Maximizing Coverage Capability in Mobile Air Quality Monitoring Systems by Nguyen, Viet Dung, Le Nguyen, Phi, Nguyen, Trung Hieu, Nguyen, Kien, Do, Phan Thuan

“…In this paper, we focus on broadening the monitoring area of a mobile air quality monitoring system, in which the sensors mounted on buses. In particular, we…”
Get full text

Approximation Algorithm for MAX DICUT with Given Sizes of Parts by Xu, Dachuan, Liu, Guanghui

Get full text

Improved Approximation Algorithms for MAX n/2-DIRECTED-BISECTION and MAX n/2-DENSE-SUBGRAPH by Xu, Dachuan, Han, Jiye, Huang, Zhenghai, Zhang, Liping

“…We consider the MAX n/2-DIRECTED-BISECTION problem, i.e., partitioning the vertices of a directed graph into two blocks of equal cardinality so as to maximize…”
Get full text

Differential approximation algorithms for some combinatorial optimization problems by Demange, Marc, Grisoni, Pascal, Paschos, Vangelis Th

“…We use a new approximation measure, the differential approximation ratio, to derive polynomial-time approximation algorithms for minimum set covering (for both…”
Get full text

Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph by Ishii, Toshimasa, Nagamochi, Hiroshi, Ibaraki, Toshihide

Get full text

Approximation Algorithms for Quadratic Programming by Fu, Minyue, Luo, Zhi-Quan, Ye, Yinyu

Get full text

The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems by Demange, Marc, Paschos, Vangelis Th

Get full text

Approximation algorithms for some routing problems by Frederickson, Greg N., Hecht, Matthew S., Kim, Chul E.

“…Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained…”
Get full text

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