Suchergebnisse - Constant-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 Algorithm for Optimal 1.5D Terrain Guarding von 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 …”
Volltext

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

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

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

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

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

A Constant-Factor Approximation Algorithm for the Geometric k -MST Problem in the Plane von 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 …”
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

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 Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem von 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 …”
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

Constant factor approximation algorithms for coalition structure generation von 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 …”
Volltext

A constant factor approximation algorithm for boxicity of circular arc graphs von 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−ε …”
Volltext

Scenario reduction revisited: fundamental limits and guarantees von 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 …”
Volltext

A constant-factor approximation algorithm for multi-vehicle collection for processing problem von 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 …”
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

Approximability of guarding weak visibility polygons von 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 …”
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