Suchergebnisse - "Polynomial-Time Approximation Algorithm"

A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem von Pan, Pengxiang, Zhu, Hongtao

“… We reconsider the min-max clustered cycle cover (MM-CCC) problem, which is described as follows. Given an undirected complete graph G=(V,E;w) with a positive …”
Volltext

A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem von Moothedath, Shana, Chaporkar, Prasanna, Belur, Madhu N.

“… This paper deals with minimum cost constrained input selection (minCCIS) for state-space structured systems. Our goal is to optimally select an input set from …”
Volltext

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions von Feng, Weiming, Guo, Heng, Jerrum, Mark, Wang, Jiaheng

“… We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions …”
Volltext

FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM von Rizhenko, Ksenia, Neznakhina, Katherine, Khachay, Michael

“… We develop the first fixed-ratio approximation algorithm for the well-known Prize-Collecting Asymmetric Traveling Salesman Problem,  which has numerous …”
Volltext

Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center von Kel’manov, A. V., Motkova, A. V.

“… A strongly NP-hard problem of partitioning a finite set of points of Euclidean space into two clusters is considered. The solution criterion is the minimum of …”
Volltext

A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements von 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 …”
Volltext

A polynomial time approximation algorithm for the two-commodity splittable flow problem von Eisenschmidt, Elke, Haus, Utz-Uwe

“… We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity can be split into a bounded …”
Volltext

Erratum to “Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks” von Bouznif, M., Giroudeau, R.

“… Approximation Results If the network is a ring, there are two approximation results for Rayward-Smith's [2] algorithm as follows. (i) In the general case, the …”
Volltext

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions von Feng, Weiming, Guo, Heng, Jerrum, Mark, Wang, Jiaheng

“… We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions …”
Volltext

A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times von 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 …”
Volltext

Control traffic balancing in software defined networks von 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 …”
Volltext

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

“… Lastly, we also design two polynomial-time approximation algorithms for complete graphs …”
Volltext

Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks von Bouznif, M., Giroudeau, R.

“… We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors …”
Volltext

A polynomial-time approximation algorithm for all-terminal network reliability von Guo, Heng, Jerrum, Mark

“… We give a fully polynomial-time randomized approximation scheme (FPRAS) for the all-terminal network reliability problem, which is to determine the probability …”
Volltext

A PTAS for the cardinality constrained covering with unit balls von 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 …”
Volltext

Design and Optimization of Electric Autonomous Vehicles with Renewable Energy Source for Smart Cities von 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 …”
Volltext

A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks von Gyouhwan Kim, Qiao Li, Negi, R.

“… In this paper, we propose a polynomial-time approximation algorithm with guaranteed accuracy for WSRM under an Ultra- wide band (UWB) assumption …”
Volltext

Fast approximation algorithms for job scheduling with processing set restrictions von 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 …”
Volltext

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

“… This paper deals with the presentation of polynomial time (approximation) algorithms for a variant of open …”
Volltext

2-Approximation algorithm for finding a clique with minimum weight of vertices and edges von 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 …”
Volltext