Výsledky vyhľadávania - (constant OR content) factor approximation algorithm

A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks Autor Madireddy, Raghunath Reddy, Mudgal, Apurva

“…The main contribution of this paper is the first constant factor approximation algorithm for red-blue set cover problem with unit disks…”
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

A Constant Factor Approximation for d -Hop Connected Dominating Set in Three-Dimensional Wireless Networks Autor Li, Ke, Gao, Xiaofeng, Wu, Fan, Chen, Guihai

“…In the past few years, wireless sensor networks (WSNs) have been widely used in many areas. In these applications, sensors are remotely deployed to gather…”
Získať plný text

A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths Autor Bonsma, Paul, Schulz, Jens, Wiese, Andreas

Získať plný text

A constant-factor approximation for weighted bond cover Autor Kim, Eun Jung, Lee, Euiwoong, Thilikos, Dimitrios M.

“… We study the problem for the class F of θc-minor-free graphs, under the equivalent setting of the Weightedc-Bond Cover problem, and present a constant-factor approximation algorithm using the primal-dual method…”
Získať plný text

A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations Autor Li, Wenzheng, Vondrak, Jan

“… Our algorithm builds on and extends a recent constant-factor approximation for Rado valuations [15]…”
Získať plný text

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center Autor Kim, Kangsan, Shin, Yongho, An, Hyung-Chan

“… In this paper, we present the first constant-factor approximation algorithm for the facility location problem with parity constraints…”
Získať plný text

Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion Autor Ahn, Jungho, Kim, Eun Jung, Lee, Euiwoong

“… ) and the goal is to delete S ⊆ V with minimum weight such that G \ S ∈ F . Designing a constant-factor approximation algorithm for large subclasses of perfect graphs has been an interesting research direction…”
Získať plný text

A constant-factor approximation for generalized malleable scheduling under [Formula omitted]-concave processing speeds Autor Fotakis, Dimitris, Matuschke, Jannik, Papadigenopoulos, Orestis

“… We study the case that processing speeds are job-dependent [Formula omitted]-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

An approximation algorithm for lower-bounded k-median with constant factor Autor Wu, Xiaoliang, Shi, Feng, Guo, Yutian, Zhang, Zhen, Huang, Junyu, Wang, Jianxin

“… -approximation for this problem…”
Získať plný text

Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time Autor Chakraborty, Diptarka, Das, Debarati, Goldenberg, Elazar, Koucky, Michal, Saks, Michael

“… Andoni, Krauthgamer and Onak (2010) gave a nearly linear time algorithm that approximates edit distance within approximation factor poly(log n…”
Získať plný text

A Constant Factor Approximation Algorithm for the Storage Allocation Problem Autor Bar-Yehuda, Reuven, Beder, Michael, Rawitz, Dror

“… We present a polynomial time ( 9 + ε ) -approximation algorithm for SAP . Our algorithm is based…”
Získať plný text

Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems Autor Neznakhina, E. D., Ogorodnikov, Yu. Yu, Rizhenko, K. V., Khachay, M. Yu

“…In this paper, the first fixed-ratio approximation algorithms are proposed for a series of asymmetric settings of well-known combinatorial routing problems…”
Získať plný text

A Constant-Factor Approximation Algorithm for the k-Median Problem Autor Charikar, Moses, Guha, Sudipto, Tardos, Éva, Shmoys, David B.

“…We present the first constant-factor approximation algorithm for the metric k-median problem…”
Získať plný text

Edit Distance in Near-Linear Time: it's a Constant Factor Autor Andoni, Alexandr, Nosatzki, Negev Shekel

“…], which showed the first constant-factor approximation algorithm with a (strongly) sub-quadratic running time…”
Získať plný text

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality Autor Mohan, Usha, Ramani, Sivaramakrishnan, Mishra, Sounaka

“… In the Biased-TSP, the edge cost function violates the triangle inequality in a “controlled” manner. We give a 72-factor approximation algorithm for this problem by a suitable modification of the double-tree heuristic…”
Získať plný text

Constant-factor approximation of the domination number in sparse graphs Autor Dvorak, ZdenAk

“… We give a linear-time constant-factor algorithm for approximation of the k-domination number in classes of graphs with bounded expansion, which include e.g…”
Získať plný text

A New Constant Factor Approximation to Construct Highly Fault-Tolerant Connected Dominating Set in Unit Disk Graph Autor Wang, Wei, Liu, Bei, Kim, Donghyun, Li, Deying, Wang, Jingyi, Gao, Wei

“…This paper proposes a new polynomial time constant factor approximation algorithm for a more-a-decade-long open NP-hard problem, the minimum four-connected m-dominating set problem in unit disk graph (UDG…”
Získať plný text

Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon Autor Browne, Reilly, Kasthurirangan, Prahlad Narasimham, Mitchell, Joseph S. B., Polishchuk, Valentin

“… other. We give constant factor approximation algorithms for both problems. Previously, the best approximation factor for the minimum convex cover was logarithmic…”
Získať plný text

Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time Autor Batra, Jatin, Garg, Naveen, Kumar, Amit

“… We give the first pseudo-polynomial time constant approximation algorithm for this problem…”
Získať plný text