Search Results - Constant-factor approximation algorithm*

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

A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding by Ben‐Moshe, Boaz, Katz, Matthew J., Mitchell, Joseph S. B.

“…We present the first constant-factor approximation algorithm for a nontrivial instance of the optimal guarding (coverage…”
Get full text

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

Get full text

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

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

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center by 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…”
Get full text

A Constant-Factor Approximation Algorithm for the Geometric k -MST Problem in the Plane by Mitchell, Joseph S. B., Blum, Avrim, Chalasani, Prasad, Vempala, Santosh

“… In particular, a consequence of our main theorem is a very simple proof that the k-MST problem in the plane has a constant-factor polynomial-time approximation algorithm…”
Get full text

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

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

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

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

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality by 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…”
Get full text

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

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

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

Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem by Khachay, M. Yu, Neznakhina, E. D., Ryzhenko, K. V.

“… to appropriate instances of the asymmetric traveling salesman problem (ATSP) and on the 22 𝜀 -approximation algorithm for this classical problem proposed by O. Svensson…”
Get full text

A constant factor approximation algorithm for boxicity of circular arc graphs by Adiga, Abhijin, Babu, Jasine, Chandran, L. Sunil

“…>0 in polynomial time, unless NP=ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n1−ε…”
Get full text

Constant factor approximation algorithms for coalition structure generation by Service, Travis C., Adams, Julie A.

“… Most algorithmic work to date can be classified into one of three broad categories: anytime algorithms, design-to-time algorithms and heuristic algorithms [5…”
Get full text

Scenario reduction revisited: fundamental limits and guarantees by Rujeerapaiboon, Napat, Schindler, Kilian, Kuhn, Daniel, Wiesemann, Wolfram

“…The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish…”
Get full text

A constant-factor approximation for weighted bond cover by 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…”
Get full text

A constant-factor approximation algorithm for multi-vehicle collection for processing problem by Yücel, E., Salman, F. S., Örmeci, E. L., Gel, E. S.

“… We develop a polynomial-time, constant-factor approximation algorithm to solve mCfPP( ). The problem with a single site is analyzed as a special case with two purposes…”
Get full text

Approximability of guarding weak visibility polygons by Bhattacharya, Pritam, Ghosh, Subir Kumar, Roy, Bodhayan

“…), which was improved up to O(loglogOPT) by King and Kirkpatrick (2011). It has been conjectured that constant-factor approximation algorithms exist for these problems…”
Get full text

Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems by 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…”
Get full text

Polynomial-Time Approximability of the Asymmetric Problem of Covering a Graph by a Bounded Number of Cycles by Khachai, M. Yu, Neznakhina, E. D., Ryzhenko, K. V.

“…) in the class of constant-factor approximation algorithms. Just as the famous Christofides–Serdyukov algorithm for the symmetric routing problems, these breakthrough results, applied as a “black box…”
Get full text