Filters








255,699 Hits in 5.0 sec

Subject Index

2005 Journal of Discrete Algorithms  
, 198; Bit-parallel approximate string matching algorithms with transposition, 215 Approximation algorithm On the approximability of the maximum induced matching problem, 79; A fully linear-time ap  ...  patterns, 293 String matching (of music) Practical algorithms for transposition-invariant string-matching, 267 Strong matching On the approximability of the maximum induced matching problem, 79  ... 
doi:10.1016/s1570-8667(05)00042-0 fatcat:phytlwupp5hmtddg3ffue5546u

Near approximation of maximum weight matching through efficient weight reduction [article]

Andrzej Lingas, Cui Di
2011 arXiv   pre-print
on W then we obtain a (1-\epsilon)-approximation algorithm for maximum weight matching in graphs running in time (epsilon^{-1})^{O(1)}(m+n).  ...  In particular, if we combine our result with the recent (1-\epsilon)-approximation algorithm for maximum weight matching in graphs due to Duan and Pettie whose time complexity has a poly-logarithmic dependence  ...  Acknowledgments The authors are very grateful to Seth Pettie for his valuable suggestions to apply the second (1 − ǫ)-approximation algorithm from [7] instead of the first one and to eliminate an n log  ... 
arXiv:1012.5911v2 fatcat:ybhxs7q5vvcy5kqde42geeszwe

Approximation Algorithms for the Maximum Carpool Matching Problem [chapter]

Gilad Kutiel
2017 Lecture Notes in Computer Science  
In the Maximum Carpool Matching problem we seek for a matching (P, D, M ) that maximizes the total weight of M .  ...  We present a 3-approximation algorithm for the problem, and 2-approximation algorithms for the unweighted and for the uncapacitated variants of the problem.  ...  Maximum Carpool Matching We now present a 3-approximation algorithm for the Maximum Carpool Matching problem. This algorithm acts in two phases.  ... 
doi:10.1007/978-3-319-58747-9_19 fatcat:uu7i24omfjgoljidotxtatnh5m

Approximation Algorithms for the Maximum Carpool Matching Problem [article]

Gilad Kutiel
2016 arXiv   pre-print
We present a 3-approximation algorithm for the problem and 2-approximation algorithm for the unweighted variant of the problem.  ...  In the Maximum Carpool Matching problem we seek for a matching (P, D, M) that maximizes the total weight of M.  ...  a 3-approximation algorithm for the Maximum Carpool Matching problem.  ... 
arXiv:1604.05609v2 fatcat:dr64yk3nsjhl5jtessbhfyxs4y

Near Approximation of Maximum Weight Matching through Efficient Weight Reduction [chapter]

Andrzej Lingas, Cui Di
2011 Lecture Notes in Computer Science  
ǫ)-approximation algorithm for maximum weight matching in graphs running in time (ǫ −1 ) O(ǫ −1 ) (m + n log n).  ...  in time In particular, if we combine our result with the recent (1 − ǫ)-approximation algorithm for maximum weight matching in graphs with small edge weights due to Duan and Pettie then we obtain (1 −  ...  Acknowledgments The authors are grateful to anonymous referees for valuable comments on a preliminary version of the paper.  ... 
doi:10.1007/978-3-642-20877-5_6 fatcat:jd5e7wdhkbhwldraw5furxxeli

A distributed-memory approximation algorithm for maximum weight perfect bipartite matching [article]

Ariful Azad, Aydın Buluc, Xiaoye S. Li, Xinliang Wang, Johannes Langguth
2018 arXiv   pre-print
This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known.  ...  We design and implement an efficient parallel approximation algorithm for the problem of maximum weight perfect matching in bipartite graphs, i.e. the problem of finding a set of non-adjacent edges that  ...  The maximum weight matching problem asks for a matching of maximum weight regardless of cardinality, while the maximum weight perfect matching (MWPM) problem asks for a perfect matching that has maximum  ... 
arXiv:1801.09809v1 fatcat:cj4xlurazjfwxm6ywdzqrqekhu

The Computational Complexity of Weighted Greedy Matching

Argyrios Deligkas, George Mertzios, Paul Spirakis
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In wide contrast to the maximum weight matching problem, for which many efficient algorithms are known, we prove that GREEDYMATCHING is strongly NP-hard and APX-complete, and thus it does not admit a PTAS  ...  Motivated by the fact that in several cases a matching in a graph is stable if and only if it is produced by a greedy algorithm, we study the problem of computing a maximum weight greedy matching on weighted  ...  Hence, every weighted greedy matching is also a 1 2 -approximation for the maximum weight greedy matching problem.  ... 
doi:10.1609/aaai.v31i1.10561 fatcat:qkog3gzemzdylfrizmwoqhqkde

A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite Graphs [article]

Florin Dobrian, Mahantesh Halappanavar, Alex Pothen, Ahmed Al-Herz
2018 arXiv   pre-print
We consider the maximum vertex-weighted matching problem (MVM), in which non-negative weights are assigned to the vertices of a graph, the weight of a matching is the sum of the weights of the matched  ...  vertices, and we are required to compute a matching of maximum weight.  ...  We call this the maximum vertex-weighted matching problem (MVM). In this paper we describe a 2/3-approximation algorithm for MVM in bipartite graphs and implement it efficiently.  ... 
arXiv:1804.08016v2 fatcat:dkwwil77gnbxdlgrykn3nnecym

A Critical Improvement on Open Shop Scheduling Algorithm for Routing in Interconnection Networks

Stavros Birmpilis, Timotheos Aslanidis
2017 International Journal of Computer Networks & Communications  
The problem of scheduling message packets through such a network is referred to as PBS and is known to be NP-Hard.  ...  We ran experiments to establish the efficiency of I_HSA and found that in all datasets used it produces schedules very close to the optimal.  ...  weight equal to the duration of the transmission for to .Given a matching in we will denote by ( ) the maximum weight of any edge ∈ , that is ( ) = { ( ), ∈ }.  ... 
doi:10.5121/ijcnc.2017.9101 fatcat:k55ulpk375cxte7wp4vzbqqpnq

Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information

Elliot Anshelevich, Shreyas Sekar
2016 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We study the Maximum Weighted Matching problem in a partial information setting where the agents' utilities for being matched to other agents are hidden and the mechanism only has access to ordinal preference  ...  Specifically, we study problems where the ground truth exists in the form of a weighted graph, and look to design algorithms that approximate the true optimum matching using only the preference orderings  ...  Algorithm 2 is an ordinal 2-approximation algorithm for the Maximum Weighted Matching problem. Proof.  ... 
doi:10.1609/aaai.v30i1.10032 fatcat:t7m72rrnpbea5dgnlp7eu7n4lq

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms

Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc, Michael Wagner
2018 International Colloquium on Automata, Languages and Programming  
As a consequence, we also obtain the first constant-approximate worst-case polylogarithmic update time maximum weight matching algorithm.  ...  Applying this reduction to the recent fractional matching algorithm of Bhattacharya, Henzinger, and Nanongkai (SODA 2017), we obtain a novel result for the integral problem.  ...  The fifth author wishes to thank Seffi Naor for a remark which inspired Definition 1.1.  ... 
doi:10.4230/lipics.icalp.2018.7 dblp:conf/icalp/ArarCCSW18 fatcat:5sw6c6dv5ve5jfvkp7l6w3b2pi

Page 2674 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
For the coarsening part we develop a new approximation algorithm for maximum weighted matching in gen- eral edge-weighted graphs.  ...  It calculates a matching with an edge weight of at least 5 of the edge weight of a maximum weighted matching. Its time complexity is O(|£|), with |E| being the num- ber of edges in the graph.  ... 

Metatheorems for Dynamic Weighted Matching

Daniel Stubbs, Virginia Vassilevska Williams, Marc Herbstritt
2017 Innovations in Theoretical Computer Science  
We consider the maximum weight matching (MWM) problem in dynamic graphs. We provide two reductions.  ...  The second reduction reduces the dynamic MWM problem to the dynamic maximum cardinality matching (MCM) problem in which the graph is unweighted.  ...  , for a total error of ε from all edges in the matching, we can divide the weights of the edges by the lower bound of their classes, resulting in needing to send weights that can be described in only O  ... 
doi:10.4230/lipics.itcs.2017.58 dblp:conf/innovations/StubbsW17 fatcat:qcbfez4n5fcchphlpy6athbec4

On the Complexity of Weight-Dynamic Network Algorithms [article]

Monika Henzinger, Ami Paz, Stefan Schmid
2021 arXiv   pre-print
While prior work on dynamic graph algorithms focuses on link insertions and deletions, we are interested in the practical problem of link weight changes.  ...  We revisit existing upper bounds in the weight-dynamic model, and present several novel lower bounds on the amortized runtime for recomputing solutions.  ...  Maximum weight matching algorithm The aforementioned dynamic algorithm for the maximum (s, t)-flow problem immediately implies a similar algorithm for the dynamic maximum weight matching problem, through  ... 
arXiv:2105.13172v2 fatcat:zcfe4uc3sragrch4l7w5jbe2fu

Building Integrated Ontological Knowledge Structures with Efficient Approximation Algorithms

Yang Xiang, Sarath Chandra Janga
2015 BioMed Research International  
We identified optimal structures in this problem and proposed optimal and efficient approximation algorithms for integrating a pair of ontologies.  ...  Furthermore, we extend the basic problem to address the integration of a large number of ontologies, and correspondingly we proposed an efficient approximation algorithm for integrating multiple ontologies  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2015/501528 pmid:26550571 pmcid:PMC4621328 fatcat:c7mt2jrwfjcxnp4gjeaaab5l2m
« Previous Showing results 1 — 15 out of 255,699 results