Book Chapter10.1007/978-3-642-27848-8_733-1
k -Best Enumeration
TL;DR: In this paper, the authors survey k-best enumeration problems and the algorithms for solving them, including the problems of finding the k shortest paths, k smallest spanning trees, and k best matchings in weighted graphs.
read more
Abstract: We survey k-best enumeration problems and the algorithms for solving them, including in particular the problems of finding the k shortest paths, k smallest spanning trees, and k best matchings in weighted graphs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficiency in Unification-Based N -Best Parsing.
Yi Zhang,Stephan Oepen,John M. Carroll +2 more
- 01 Jan 2010
TL;DR: A recently proposed algorithm for n-best unpacking of parse forests is extended to deal efficiently with Maximum Entropy parse selection models containing important classes of non-local features and forests produced by unification grammars containing significant proportions of globally inconsistent analyses.
54
Discovering and synthesizing humanoid climbing movements
TL;DR: To the best of the knowledge, this is the first paper to solve and simulate rich humanoid wall climbing, where more than one limb can move at the same time, and limbs can also hang free for balance or use wall friction in addition to predefined holds.
41
Socially shared regulation of learning in game-based collaborative learning environments promotes algorithmic thinking, learning participation and positive learning attitudes
TL;DR: This paper examined whether socially shared regulation of learning (SSRL) enhances students' algorithmic thinking performance, promotes learning participation and improves students' learning attitu cation, and found that SSRL enhances student's algorithmic learning performance.
12
Approximating the Canadian Traveller Problem with Online Randomization
TL;DR: In this paper, a polynomial time randomized algorithm was proposed for the Canadian Traveller Problem with at most two road blockages and a lower bound of O(1) by an o(1)-factor.
5
•Posted Content
From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph.
TL;DR: An O(m)-time algorithm to identify all maximal omnitigs, thanks to the discovery of a family of walks (macrotigs) with the property that all the non-trivial omnitig are univocal extensions of subwalks of a macrotig.
4
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Finding the K Shortest Loopless Paths in a Network
TL;DR: The significance of the new algorithm is that its computational upper bound increases only linearly with the value of K, so it is extremely efficient as compared with the algorithms proposed by Bock, Kantner, and Haynes and others.
2.4K
Time bounds for selection
TL;DR: The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK.
1.5K
Finding the k Shortest Paths
TL;DR: K shortest paths are given for finding the k shortest paths connecting a pair of vertices in a digraph, and applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery are described.
1.5K
Multiple Object Tracking Using K-Shortest Paths Optimization
TL;DR: This paper shows that reformulating that step as a constrained flow optimization results in a convex problem and takes advantage of its particular structure to solve it using the k-shortest paths algorithm, which is very fast.