Suchergebnisse - (constant OR content) factor approximation algorithm

A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks von 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 …”
Volltext

A constant-factor approximation for generalized malleable scheduling under M♮-concave processing speeds von 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 …”
Volltext

A Constant Factor Approximation for d -Hop Connected Dominating Set in Three-Dimensional Wireless Networks von 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 …”
Volltext

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

Volltext

A constant-factor approximation for weighted bond cover von 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 …”
Volltext

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

“… Our algorithm builds on and extends a recent constant-factor approximation for Rado valuations [15] …”
Volltext

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center von 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 …”
Volltext

Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion von 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 …”
Volltext

A constant-factor approximation for generalized malleable scheduling under [Formula omitted]-concave processing speeds von 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 …”
Volltext

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

“… -approximation for this problem …”
Volltext

Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time von 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 …”
Volltext

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

“… We present a polynomial time ( 9 + ε ) -approximation algorithm for SAP . Our algorithm is based …”
Volltext

Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems von 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 …”
Volltext

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

“… We present the first constant-factor approximation algorithm for the metric k-median problem …”
Volltext

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

“… ], which showed the first constant-factor approximation algorithm with a (strongly) sub-quadratic running time …”
Volltext

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality von 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 …”
Volltext

Constant-factor approximation of the domination number in sparse graphs von 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 …”
Volltext

A New Constant Factor Approximation to Construct Highly Fault-Tolerant Connected Dominating Set in Unit Disk Graph von 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 …”
Volltext

Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon von 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 …”
Volltext

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

“… We give the first pseudo-polynomial time constant approximation algorithm for this problem …”
Volltext