Výsledky vyhľadávania - Matching Problem and Algorithm

Action-Informed Artificial Intelligence-Matching the Algorithm to the Problem Autor Lindsell, Christopher J, Stead, William W, Johnson, Kevin B

Zistit podrobnosti o prístupe

The matching augmentation problem: a 74-approximation algorithm Autor Cheriyan, J., Dippel, J., Grandoni, F., Khan, A., Narayan, V. V.

“…We present a 7 4 approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost…”
Získať plný text

A self-stabilizing 2 3 -approximation algorithm for the maximum matching problem Autor Manne, Fredrik, Mjelde, Morten, Pilard, Laurence, Tixeuil, Sébastien

“… In this paper, we present the first self-stabilizing algorithm for finding a 2 3 -approximation to the maximum matching problem in a general graph…”
Získať plný text

The matching augmentation problem: a 7 4 -approximation algorithm Autor Cheriyan, J, Dippel, J, Grandoni, F, Khan, A, Narayan, V V

“…We present a 74 approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2-edge connected spanning subgraph…”
Získať plný text

A two-sided matching-based multi-objective differential evolution algorithm for the slab matching problem in the steel industry Autor Huang, Junting, Meng, Ying, Dong, Yun, Liu, Chang, Zhao, Shengnan

Získať plný text

A Path Following Algorithm for the Graph Matching Problem Autor Zaslavskiy, M., Bach, F., Vert, J.-P.

“…We propose a convex-concave programming approach for the labeled weighted graph matching problem…”
Získať plný text

An Extended Path Following Algorithm for Graph-Matching Problem Autor Liu, Zhi-Yong, Qiao, Hong, Xu, Lei

“…The path following algorithm was proposed recently to approximately solve the matching problems on undirected graph models and exhibited a state-of-the-art performance on matching accuracy…”
Získať plný text

A data-driven matching algorithm for ride pooling problem Autor Şahin, Ahmet, Sevim, İsmail, Albey, Erinç, Güler, Mehmet Güray

“…This paper proposes a data-driven matching algorithm for the problem of ride pooling, which is a transportation mode enabling people to share a vehicle for a trip…”
Získať plný text

Algorithms solving the Matching Cut problem Autor Kratsch, Dieter, Le, Van Bang

“…In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete…”
Získať plný text

A factor approximation algorithm for two-stage stochastic matching problems Autor Kong, Nan, Schaefer, Andrew J.

“…We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete…”
Získať plný text

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles Autor Le, Hoang-Oanh, Le, Van Bang

“… (pmc), is the problem of deciding whether a given graph has a matching cut, respectively, a perfect matching cut…”
Získať plný text

A matching-based approximation algorithm for the traveling tournament problem Autor Zhao, Jingyang, Xiao, Mingyu

“… In this paper, we focus on TTP-4 and design an efficient algorithm for it based on minimum weight matching…”
Získať plný text

The α-reliable path problem in stochastic road networks with link correlations: A moment-matching-based path finding algorithm Autor Chen, Peng, Tong, Rui, Lu, Guangquan, Wang, Yunpeng

“…•A moment-matching-based hybrid genetic algorithm is proposed to search RSP.•Empirical travel time data from probe vehicles are utilized to measure TTR…”
Získať plný text

Preference profiles determining the proposals in the Gale–Shapley algorithm for stable matching problems Autor Sukegawa, Noriyoshi, Yamamoto, Yoshitsugu

“…–Shapley algorithm produce the prescribed complete matching of men and women. Reformulating this problem by introducing the set of proposals to be made…”
Získať plný text

A dynamic learning algorithm for online matching problems with concave returns Autor Chen, Xiao Alison, Wang, Zizhuo

“…•We consider the online matching problem with concave returns. It is the core model for ad allocation…”
Získať plný text

A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system Autor Masoud, Neda, Jayakrishnan, R.

“…•An optimal, real-time algorithm for the multi-hop P2P ride-matching problem.•Serving requests as soon as they arrive on a first-come, first-served (FCFS) basis…”
Získať plný text

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems Autor Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D. M., Whitesides, S.

“…We obtain faster algorithms for problems such as r -dimensional matching and r -set packing when the size k of the solution is considered a parameter…”
Získať plný text

Solving Ontology Meta-Matching Problem Through an Evolutionary Algorithm With Approximate Evaluation Indicators and Adaptive Selection Pressure Autor Lv, Qing, Jiang, Chengcai, Li, He

“… As an effective method, ontology matching can address the problem above, whose core technique is the similarity measure…”
Získať plný text

A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem Autor Masoud, Neda, Jayakrishnan, R.

“…•A computationally efficient and exact algorithm for the multi-hop P2P ride-matching problem…”
Získať plný text

A note on “An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs” Autor Lee, Kangbok, Leung, Joseph Y.-T., Pinedo, Michael L.

“…We point out an error in the algorithm for the Load Balanced Semi-Matching Problem presented by C.P. Low [C.P…”
Získať plný text