Výsledky vyhledávání - "polynomial-time approximation algorithms"

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing Autor Guoliang Xue, Weiyi Zhang, Jian Tang, Thulasiraman, K.

“… = 2, the problem has been well studied, with several provably good polynomial time-approximation algorithms reported in the literature, which enforce one constraint while approximating…”
Získat plný text

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

“… terminals) are connected through components, which are subject to random failure and repair processes. At any time, a system failure occurs if the surviving system fails to connect…”
Získat plný text

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

Získat plný text

Committee polyhedral separability: complexity and polynomial approximation Autor Khachay, Michael

“…We consider the minimum affine separating committee (MASC) combinatorial optimization problem, which is related to ensemble machine learning techniques on the…”
Získat plný text

Maximizing Social Welfare Subject to Network Externalities: A Unifying Submodular Optimization Approach Autor Etesami, S. Rasoul

“…We consider the problem of allocating multiple indivisible items to a set of networked agents to maximize the social welfare subject to network effects (externalities…”
Získat plný text

Approximation algorithms for homogeneous polynomial optimization with quadratic constraints Autor He, Simai, Li, Zhening, Zhang, Shuzhong

“… In this paper we shall focus on polynomial-time approximation algorithms. In particular, we first study optimization of a multi-linear tensor function over the Cartesian product of spheres…”
Získat plný text

Computing maximum matchings in temporal graphs Autor Mertzios, George B., Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor, Zschoche, Philipp

“…Temporal graphs are graphs whose topology is subject to discrete changes over time…”
Získat plný text

Digital Twin Placement for Minimum Application Request Delay With Data Age Targets Autor Vaezi, Mehrad, Noroozi, Kiana, Todd, Terence D., Zhao, Dongmei, Karakostas, George

“… In this article, we consider the problem of DT placement such that the maximum data request-response delay experienced by the application over all PSs is minimized, subject to maximum data age target…”
Získat plný text

Jointly Optimal Routing and Caching for Arbitrary Network Topologies Autor Ioannidis, Stratis, Yeh, Edmund

“… The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal…”
Získat plný text

Energy Minimization via Joint Caching and Power Control in Wireless Heterogeneous Networks Autor Zhang, Jinkun, Mutlu, Faruk Volkan, Goldsmith, Andrea, Yeh, Edmund

“… The offline version of this problem is NP-hard, but we show that there exist polynomial-time approximation algorithms producing solutions within a constant factor 1 - 1/ e from the optimal…”
Získat plný text

Multi-User MIMO Scheduling in the Fourth Generation Cellular Uplink Autor Prasad, Narayan, Honghai Zhang, Hao Zhu, Rangarajan, Sampath

“… We then propose constant-factor polynomial-time approximation algorithms and demonstrate their superior performance via simulations…”
Získat plný text

Efficient computation of evacuation routes on a three-dimensional geometric network Autor Tang, Huajun, Elalouf, Amir, Levner, Eugene, Cheng, T.C.E.

“…•We prove the problem to be NP-hard.•We suggest the exact dynamic programming algorithm and two polynomial time approximation algorithms…”
Získat plný text

Approximation in two-stage stochastic integer programming Autor Romeijnders, Ward, Stougie, Leen, van der Vlerk, Maarten H.

“…Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most…”
Získat plný text

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

Získat plný text

New Problems and Algorithms in Combinatorial Optimization Autor Wang, Jiaqi

“…Combinatorial optimization seeks optimal solutions from a finite set of objects. It is widely applied to many real-world problems, such as logistics, network…”
Získat plný text

Complexity of minimum length scheduling for precedence constrained messages in distributed systems Autor Barcaccia, P., Bonuccelli, M.A., di Ianni, M.

“…Switching networks are the core of many communication and multiprocessor systems. In these systems, a set of entities (communication equipment or processors)…”
Získat plný text

Analysis and Design of Robust and High-Performance Complex Dynamical Networks Autor Siami, Milad

“…In the first part of this dissertation, we develop some basic principles to investigate performance deterioration of dynamical networks subject to external disturbances…”
Získat plný text

Bicriteria Network Design Problems Autor Marathe, Madhav V, Ravi, R, Sundaram, Ravi, Ravi, S.S, Rosenkrantz, Daniel J, Hunt, Harry B

“… Here, we present the first polynomial-time approximation algorithms for a large class of bicriteria network design problems for the previously mentioned criteria…”
Získat plný text

Solving convex QPs with structured sparsity under indicator conditions Autor Bienstock, Daniel, Chen, Tongtong

“… We describe a family of polynomial-time approximation algorithms and negative complexity results…”
Získat plný text

Maximizing Social Welfare Subject to Network Externalities: A Unifying Submodular Optimization Approach Autor Etesami, S Rasoul

“… That allows us to devise polynomial-time approximation algorithms using the Lovasz extension and multilinear extension of the objective functions…”
Získat plný text