Suchergebnisse - "Constant-factor approximation algorithms"

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

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.

“… For the first time, algorithms with constant performance guarantees are substantiated for a series of asymmetric routing problems of combinatorial …”
Volltext

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

“… Coalition structure generation is a central problem in characteristic function games. Most algorithmic work to date can be classified into one of three broad …”
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 the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs von Backer, Jonathan, Keil, J. Mark

“… The densest k-subgraph problem asks for a k-vertex subgraph with the maximum number of edges. This problem is NP-hard on bipartite graphs, chordal graphs, and …”
Volltext

Constant-Factor Approximation Algorithms for Socially Fair \(k\)-Clustering von Ghadiri, Mehrdad, Singh, Mohit, Vempala, Santosh S

“… We study approximation algorithms for the socially fair \((\ell_p, k)\)-clustering problem with \(m\) groups, whose special cases include the socially fair …”
Volltext

On fully dynamic constant-factor approximation algorithms for clustering problems von Fichtenberger, Hendrik, Henzinger, Monika, Wiese, Andreas

“… Clustering is an important task with applications in many fields of computer science. We study the fully dynamic setting in which we want to maintain good …”
Volltext

Simpler constant factor approximation algorithms for weighted flow time -- now for any \(p\)-norm von Armbruster, Alexander, Rohwedder, Lars, Wiese, Andreas

“… A prominent problem in scheduling theory is the weighted flow time problem on one machine. We are given a machine and a set of jobs, each of them characterized …”
Volltext

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems von Kim, Kangsan, Shin, Yongho, Hyung-Chan, An

“… In this paper, we present the first constant-factor approximation algorithm for the facility location problem with parity constraints …”
Volltext

Constant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad von Grover, Sapna, Gupta, Neelima, Khuller, Samir, Pancholi, Aditya

“… In this paper, we give first constant factor approximation for capacitated knapsack median problem (CKM) for hard uniform capacities, violating the budget only …”
Volltext

Efficient constant factor approximation algorithms for stabbing line segments with equal disks von Kobylkin, Konstantin

“… An NP-hard problem is considered of intersecting a given set of \(n\) straight line segments on the plane with the smallest cardinality set of disks of fixed …”
Volltext

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 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

“… We present a 380-approximation algorithm for the Nash Social Welfare problem with submodular valuations. Our algorithm builds on and extends a recent …”
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 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 = ( …”
Volltext

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

Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time von 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 …”
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