Results 1  10
of
166
Greedy Online Bipartite Matching on Random Graphs
, 2013
"... We study the average performance of online greedy matching algorithms on G(n, n, p), the random bipartite graph with n vertices on each side and edges occurring independently with probability p = p(n). In the online model, vertices on one side of the graph are given up front while vertices on the ot ..."
Abstract
 Add to MetaCart
We study the average performance of online greedy matching algorithms on G(n, n, p), the random bipartite graph with n vertices on each side and edges occurring independently with probability p = p(n). In the online model, vertices on one side of the graph are given up front while vertices
Online Bipartite Matching with Decomposable Weights
, 2014
"... We study a weighted online bipartite matching problem: G(V1, V2, E) is a weighted bipartite graph where V1 is known beforehand and the vertices of V2 arrive online. The goal is to match vertices of V2 as they arrive to vertices in V1, so as to maximize the sum of weights of edges in the matching. If ..."
Abstract
 Add to MetaCart
We study a weighted online bipartite matching problem: G(V1, V2, E) is a weighted bipartite graph where V1 is known beforehand and the vertices of V2 arrive online. The goal is to match vertices of V2 as they arrive to vertices in V1, so as to maximize the sum of weights of edges in the matching
Randomized online algorithms for minimum metric bipartite matching
 In SODA ’06
, 2006
"... We present the rst polylogarithmic competitive online algorithm for minimum metric bipartite matching. Via induction and a careful use of potential functions, we show that a simple randomized greedy algorithm is competitive on a hierarchically separated tree. Application of recent results on random ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We present the rst polylogarithmic competitive online algorithm for minimum metric bipartite matching. Via induction and a careful use of potential functions, we show that a simple randomized greedy algorithm is competitive on a hierarchically separated tree. Application of recent results
Online Bipartite Perfect Matching With
"... Abstract—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have a bipartite graph G between n clients and n servers, which represents the servers to which each client can connect ..."
Abstract
 Add to MetaCart
Abstract—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have a bipartite graph G between n clients and n servers, which represents the servers to which each client can
Biobjective Online Bipartite Matching
"... Motivated by Online Ad allocation when there are multiple conflicting objectives, we introduce and study the problem of Biobjective Online Bipartite Matching, a strict generalization of the standard setting of Karp, Vazirani and Vazirani [9], where we are allowed to have edges of two colors, and th ..."
Abstract
 Add to MetaCart
Motivated by Online Ad allocation when there are multiple conflicting objectives, we introduce and study the problem of Biobjective Online Bipartite Matching, a strict generalization of the standard setting of Karp, Vazirani and Vazirani [9], where we are allowed to have edges of two colors
Compressed suffix arrays and suffix trees with applications to text indexing and string matching
, 2005
"... The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for spaceefficient text indexing methods that support fast string searching. We model this scenario as follows: Consider a text T consisting of n symbols drawn from a fixed alphabet Σ. ..."
Abstract

Cited by 239 (20 self)
 Add to MetaCart
The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for spaceefficient text indexing methods that support fast string searching. We model this scenario as follows: Consider a text T consisting of n symbols drawn from a fixed alphabet Σ
Online Weighted Matching
, 1993
"... We introduce and study online versions of weighted matching problems in metric spaces. We present a simple 2k \Gamma 1 competitive algorithm for online minimum weighted bipartite matching where 2k is the number of nodes. We show that this competitiveness is optimal. For online maximum matching, we p ..."
Abstract

Cited by 56 (4 self)
 Add to MetaCart
We introduce and study online versions of weighted matching problems in metric spaces. We present a simple 2k \Gamma 1 competitive algorithm for online minimum weighted bipartite matching where 2k is the number of nodes. We show that this competitiveness is optimal. For online maximum matching, we
Online bipartite matching with unknown distributions
 In STOC
, 2011
"... We consider the online bipartite matching problem in the unknown distribution input model. We show that the Ranking algorithm of [KVV90] achieves a competitive ratio of at least 0.653. This is the first analysis to show an algorithm which breaks the natural 1 − 1/e ‘barrier ’ in the unknown distribu ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
We consider the online bipartite matching problem in the unknown distribution input model. We show that the Ranking algorithm of [KVV90] achieves a competitive ratio of at least 0.653. This is the first analysis to show an algorithm which breaks the natural 1 − 1/e ‘barrier ’ in the unknown
Results 1  10
of
166