A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
Sign Up to like & getrecommendations! Published in 2017 at "Networks"
DOI: 10.1002/net.21742
Abstract: We prove that any polynomial-time $\alpha(n)$-approximation algorithm for the $n$-vertex metric asymmetric Traveling Salesperson Problem yields a polynomial-time $O(\alpha(C))$-approximation algorithm for the mixed and windy Capacitated Arc Routing Problem, where $C$ is the number of… read more here.
Keywords: approximation algorithm; approximation; polynomial time; problem ... See more keywords
An approximation algorithm for genome sorting by reversals to recover all adjacencies
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0346-y
Abstract: Genome rearrangement problems have been extensively studied for more than two decades, intended to understand the species evolutionary relationships in terms of the long range genetic mutations at the genome level. While most earlier studies… read more here.
Keywords: reversals recover; recover adjacencies; sorting reversals; approximation algorithm ... See more keywords
A tight linear time $$\frac{13}{12}$$1312-approximation algorithm for the $$P2 || C_{\max }$$P2||Cmax problem
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00399-w
Abstract: We consider problem $$P2 || C_{\max }$$P2||Cmax where the goal is to schedule n jobs on two identical parallel machines to minimize the makespan. We focus on constant factor approximation algorithms with complexity independent from… read more here.
Keywords: frac 1312; time; 1312 approximation; max cmax ... See more keywords
Approximation algorithm for minimum partial multi-cover under a geometric setting
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Letters"
DOI: 10.1007/s11590-021-01746-9
Abstract: In a minimum partial set multi-cover problem (MinPSMC), given an element set X , a collection of subsets $${\mathcal {S}} \subseteq 2^X$$ S ⊆ 2 X , a cost $$c_S$$ c S on each set… read more here.
Keywords: approximation algorithm; problem; multi cover; minimum partial ... See more keywords
Improved Approximation Algorithm for Scheduling on a Serial Batch Machine with Split-Allowed Delivery
Sign Up to like & getrecommendations! Published in 2020 at "Journal of the Operations Research Society of China"
DOI: 10.1007/s40305-018-0210-x
Abstract: This paper considers the integrated production and delivery scheduling on a serial batch machine, in which split is allowed in the delivery of the jobs. The objective is to minimize the makespan, i.e., the maximum… read more here.
Keywords: approximation algorithm; serial batch; batch machine; delivery ... See more keywords
Baseband Unit Pool Planning for Cloud Radio Access Networks: An Approximation Algorithm
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2016.2620461
Abstract: Cloud radio access networks (C-RANs) are proposed as promising architecture to improve the capacity and enhance the coverage of mobile communication systems. In this letter, we study the baseband unit (BBU) pools planning problem in… read more here.
Keywords: access networks; approximation algorithm; radio; baseband unit ... See more keywords
Minimizing the Installation Cost of Ground Stations in Satellite Networks: Complexity, Dynamic Programming and Approximation Algorithm
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Wireless Communications Letters"
DOI: 10.1109/lwc.2020.3031717
Abstract: In this letter, we study the optimum selection of ground stations (GSs) in RF/optical satellite networks (SatNets) in order to minimize the overall installation cost under an outage probability requirement, assuming independent weather conditions between… read more here.
Keywords: satellite networks; installation cost; ground stations; approximation algorithm ... See more keywords
Distributed Stochastic Approximation Algorithm With Expanding Truncations
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2019.2912713
Abstract: In this paper, a novel distributed stochastic approximation algorithm (DSAA) is proposed to seek roots of the sum of local functions, each of which is associated with an agent from multiple agents connected over a… read more here.
Keywords: expanding truncations; local functions; stochastic approximation; approximation algorithm ... See more keywords
Maximizing Capacity in Cognitive Radio Networks Under Physical Interference Model
Sign Up to like & getrecommendations! Published in 2017 at "IEEE/ACM Transactions on Networking"
DOI: 10.1109/tnet.2017.2718022
Abstract: A fundamental problem in cognitive radio networks (CRN) is the following capacity maximization in CRN (CM-CRN) problem: given a set of primary links with a common transmitter, together with a set of secondary links, select… read more here.
Keywords: approximation algorithm; approximation; cognitive radio; radio networks ... See more keywords
The Conjugate Gradient Viscosity Approximation Algorithm for Split Generalized Equilibrium and Variational Inequality Problems
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Function Spaces"
DOI: 10.1155/2018/8056276
Abstract: In this paper, we study a kind of conjugate gradient viscosity approximation algorithm for finding a common solution of split generalized equilibrium problem and variational inequality problem. Under mild conditions, we prove that the sequence… read more here.
Keywords: split generalized; gradient viscosity; approximation algorithm; viscosity approximation ... See more keywords
Discrete Spectrum Reconstruction Using Integral Approximation Algorithm
Sign Up to like & getrecommendations! Published in 2017 at "Applied Spectroscopy"
DOI: 10.1177/0003702817694181
Abstract: An inverse problem in spectroscopy is considered. The objective is to restore the discrete spectrum from observed spectrum data, taking into account the spectrometer’s line spread function. The problem is reduced to solution of a… read more here.
Keywords: approximation algorithm; integral approximation; solution; spectroscopy ... See more keywords