Výsledky vyhledávání - "constant-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ískat plný text

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

Získat plný text

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

“…We present a 380-approximation algorithm for the Nash Social Welfare problem with submodular valuations. Our algorithm builds on and extends a recent…”
Získat 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ískat plný text

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

“…We study the storage allocation problem ( SAP ) which is a variant of the unsplittable flow problem on paths ( UFPP ). A SAP instance consists of a path P = (…”
Získat plný text

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

“…In this paper, we study the approximability of a variant of the Traveling Salesman Problem called the Biased-TSP. In the Biased-TSP, the edge cost function…”
Získat 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

“…In the weighted flow-time problem on a single machine, we are given a set of n jobs, where each job has a processing requirement p_j, release date r_j and…”
Získat plný text

A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding Autor 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…”
Získat plný text

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

“…The boxicity (resp. cubicity) of a graph G(V,E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes…”
Získat plný text

Scenario reduction revisited: fundamental limits and guarantees Autor 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…”
Získat plný text

A constant-factor approximation algorithm for multi-vehicle collection for processing problem Autor 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…”
Získat plný text

Approximability of guarding weak visibility polygons Autor 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…”
Získat plný text

Polynomial-Time Approximability of the Asymmetric Problem of Covering a Graph by a Bounded Number of Cycles Autor 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…”
Získat plný text

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

“…For the first time, algorithms with constant performance guarantees are substantiated for a series of asymmetric routing problems of combinatorial…”
Získat plný text

A constant factor approximation algorithm for the fault-tolerant facility location problem Autor Guha, Sudipto, Meyerson, Adam, Munagala, Kamesh

“…We consider a generalization of the classical facility location problem, where we require the solution to be fault-tolerant. In this generalization, every…”
Získat plný text

A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria Autor Srinivasan, Aravind, Teo, Chung-Piaw

“…We present the first constant-factor approximation algorithm for a fundamental problem…”
Získat plný text

A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths Autor Bonsma, P., Schulz, J., Wiese, A.

“…In this paper, we present a constant-factor approximation algorithm for the unsplittable flow problem on a path…”
Získat plný text

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

“…We show that any rectilinear polygonal subdivision in the plane can be converted into a "guillotine" subdivision whose length is at most twice that of the…”
Získat plný text

Augmenting Outerplanar Graphs to Meet Diameter Requirements Autor Ishii, Toshimasa

“… It is known that no constant factor approximation algorithms to this problem with an arbitrary graph G can be obtained unless P…”
Získat plný text

A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery Autor Vaezi, Arash, Ghodsi, Mohammad

“… It was proved that the point guarding problem is APX-complete, meaning that we cannot do better than a constant-factor approximation algorithm unless \(P = NP…”
Získat plný text