Results 1  10
of
3,087,794
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
An improved approximation algorithm for multiway cut
 Journal of Computer and System Sciences
, 1998
"... Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due ..."
Abstract

Cited by 74 (5 self)
 Add to MetaCart
to Dahlhaus, � Johnson, Papadimitriou, Seymour, and Yannakakis gave a performance guarantee of 2 1 − 1 k. In this paper, we present a new linear programming relaxation for Multiway Cut and a new approximation algorithm based on it. The algorithm breaks the threshold of 2 for approximating Multiway Cut
Improved Approximation Algorithms for MAX SAT
 In Proceedings of the 11th Annual ACMSIAM Symposium on Discrete Algorithms, SODA'00
, 2000
"... MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Goemans and Williamson and pr ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Goemans and Williamson
Improved Approximation Algorithms for Resource Allocation
, 2002
"... We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity B of available resource. We show that this NPhard Resource Allocation problem can be (1=2 \Gamma &q ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
")approximated in polynomial time, which improves upon earlier approximation results for this problem, the best previously published result being a 1=4approximation. We also give a simpler and faster 1=3approximation algorithm.
Improved approximation algorithms for broadcast scheduling
 In Proc. of 7 th Annual ACMSIAM Symposium on Discrete Algorithms
, 2004
"... We consider two scheduling problems in the broadcast setting. The first is that of minimizing the average response time of requests. For the offline version of this problem we give an algorithm with an approximation ratio of O(log 2 (n) / log log(n)), where n is the total number of pages. This subst ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
. The goal is to maximize the total profit. We give an algorithm with an approximation ratio of 5/6, which improves the previously best known approximation guarantee of 3/4 for the problem [13]. 1
Improved Approximation Algorithms for Metric Facility Location Problems
 In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
, 2002
"... In this paper we present a 1.52approximation algorithm for the metric uncapacitated facility location problem, and a 2approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for ..."
Abstract

Cited by 142 (12 self)
 Add to MetaCart
In this paper we present a 1.52approximation algorithm for the metric uncapacitated facility location problem, and a 2approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor
Improved Approximation Algorithms for Budgeted Allocations
"... Abstract. We provide a 3/2approximation algorithm for an offline budgeted allocations problem, an improvement over the e/(e − 1) approximation of Andelman and Mansour [1] and the e/(e − 1) − ɛ approximation (for ɛ ≈ 0.0001) of Feige and Vondrak [5] for the more general Maximum Submodular Welfare ( ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. We provide a 3/2approximation algorithm for an offline budgeted allocations problem, an improvement over the e/(e − 1) approximation of Andelman and Mansour [1] and the e/(e − 1) − ɛ approximation (for ɛ ≈ 0.0001) of Feige and Vondrak [5] for the more general Maximum Submodular Welfare
Improved Approximation Algorithms for Relay Placement
"... Abstract. In the relay placement problem the input is a set of sensors and a number r ≥ 1, the communication range of a relay. In the onetier version of the problem the objective is to place a minimum number of relays so that between every pair of sensors there is a path through sensors and/or rela ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
/or relays such that the consecutive vertices of the path are within distance r if both vertices are relays and within distance 1 otherwise. The twotier version adds the restrictions that the path must go through relays, and not through sensors. We present a 3.11approximation algorithm for the one
Improved Approximation Algorithms for Metric Facility Location Problems
 In Approximation Algorithms for Combinatorial Optimization
, 2001
"... In this note we present an improved approximation algorithm for the (uncapacitated) metric facility location problem. This algorithm uses the idea of cost scaling, the greedy algorithm of [5], and the greedy augmentation procedure of [1, 3]. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this note we present an improved approximation algorithm for the (uncapacitated) metric facility location problem. This algorithm uses the idea of cost scaling, the greedy algorithm of [5], and the greedy augmentation procedure of [1, 3]. 1
Results 1  10
of
3,087,794