Výsledky vyhľadávania - 68W25 (Algorithms in computer science; Approximation Algorithm)*

Approximation algorithms for flexible graph connectivity Autor Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash, Ibrahimpur, Sharat

“…We present approximation algorithms for several network design problems in the model of flexible graph connectivity (Adjiashvili et al., in: IPCO, pp 13…”
Získať plný text

Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem Autor Pan, Pengxiang, Lichen, Junran, Li, Jianping

“…In this paper, we address the vertex-traversing-constrained mixed Chinese postman problem (the VtcMCP problem), which is a further generalization of the…”
Získať plný text

Submodular maximization meets streaming: matchings, matroids, and more Autor Chakrabarti, Amit, Kale, Sagar

“… We give two incomparable algorithms for this problem with space usage falling in the semi-streaming range—they store only O ( n ) edges, using O ( n log n ) working memory…”
Získať plný text

A constant-factor approximation for generalized malleable scheduling under M♮-concave processing speeds Autor Fotakis, Dimitris, Matuschke, Jannik, Papadigenopoulos, Orestis

“… We study the case that processing speeds are job-dependent M ♮ -concave functions and provide a constant-factor approximation for this setting, significantly expanding the realm of functions for which such an approximation is possible…”
Získať plný text

LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization Autor El Housni, Omar, Foussoul, Ayoub, Goyal, Vineet

“… ( log log m 1 log m 1 log log m 2 log m 2 ) -approximation algorithm for this problem where m 1 and m 2 are the number of packing constraints in X and Y respectively…”
Získať plný text

Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings Autor Rieger, Alon, Segev, Danny

“…), who devised three approximation schemes that operate in very specific circumstances. Unfortunately, these algorithmic results suffer from two major limitations, either…”
Získať plný text

Approximate and strategyproof maximin share allocation of chores with ordinal preferences Autor Aziz, Haris, Li, Bo, Wu, Xiaowei

“… By a tighter analysis, we show that for n = 2 and 3, our algorithm achieves better approximation ratios, and is actually optimal…”
Získať plný text

A PTAS for the horizontal rectangle stabbing problem Autor Khan, Arindam, Subramanian, Aditya, Wiese, Andreas

“…We study rectangle stabbing problems in which we are given n axis-aligned rectangles in the plane that we want to stab , that is, we want to select line…”
Získať plný text

Online non-monotone diminishing return submodular maximization in the bandit setting Autor Ju, Jiachen, Wang, Xiao, Xu, Dachuan

“… We provide an analysis of the approximation ratio and regret bound of the proposed algorithm…”
Získať plný text

Thresholded covering algorithms for robust and max–min optimization Autor Gupta, Anupam, Nagarajan, Viswanath, Ravi, R.

“… We show that this template gives good approximation…”
Získať plný text

Maximizing the number of rides served for time-limited Dial-a-Ride Autor Anthony, Barbara M., Chung, Christine, Das, Ananya, Yuen, David

“… We also show that the approximation ratio is unbounded for a reasonable class of algorithms for this problem…”
Získať plný text

A fast backward implicit integration factor scheme for nonlinear spatial fractional backward diffusion problems Autor Jian, Huanyan, Xiong, Ping, Qu, Xiaomei, Liu, Tao, Tan, Wenrong

“… The stability and error analysis of BIIF are introduced. In order to improve the computational efficiency of implementing BIIF, we propose the ARA-BG fast solving algorithm, which combines the adaptive restarting shift-invert Arnoldi (ARA…”
Získať plný text

SVD-based algorithms for fully-connected tensor network decomposition Autor Wang, Mengyu, Li, Hanyu

“… In this work, we investigate the SVD-based algorithms for FCTN decomposition to tackle the aforementioned deficiencies…”
Získať plný text

A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems Autor Fernandes, Cristina G., Meira, Luis A. A., Miyazawa, Flávio K., Pedrosa, Lehilton L. C.

“…), and show that each such program can be solved by a computer to bound the approximation factor of an associated algorithm…”
Získať plný text

Correction of a High-Order Numerical Method for Approximating Time-Fractional Wave Equation Autor Ramezani, M., Mokhtari, R., Yan, Y.

“… ) . Based on this approximation, we propose a novel numerical method to solve the time-fractional wave equation…”
Získať plný text

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree Autor Feldmann, Andreas Emil, Könemann, Jochen, Olver, Neil, Sanità, Laura

“…The bottleneck of the currently best ( ln ( 4 ) + ε ) -approximation algorithm for the NP-hard Steiner tree problem is the solution of its large, so called hypergraphic , linear programming relaxation ( HYP…”
Získať plný text

Strong LP formulations for scheduling splittable jobs on unrelated machines Autor Correa, José, Marchetti-Spaccamela, Alberto, Matuschke, Jannik, Stougie, Leen, Svensson, Ola, Verdugo, Víctor, Verschae, José

“… First we show that the straightforward LP, extending the approach for the original problem, has an integrality gap of 3 and yields an approximation algorithm of the same factor…”
Získať plný text

Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs Autor Buys, Pjotr, Galanis, Andreas, Patel, Viresh, Regts, Guus

“…$, where, on one hand, the classical algorithm of Jerrum and Sinclair gives a randomised approximation scheme on the real…”
Získať plný text

Coupled and k-sided placements: generalizing generalized assignment Autor Korupolu, Madhukar, Meyerson, Adam, Rajaraman, Rajmohan, Tagiku, Brian

“…In modern data centers and cloud computing systems, jobs often require resources distributed across nodes providing a wide variety of services. Motivated by…”
Získať plný text

Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship Autor Caragiannis, Ioannis, Filos-Ratsikas, Aris, Frederiksen, Søren Kristoffer Stiil, Hansen, Kristoffer Arnsfelt, Tan, Zihan

“…We study the truthful facility assignment problem, where a set of agents with private most-preferred points on a metric space have to be assigned to facilities…”
Získať plný text