The following pages link to (Q5519711):
Displaying 37 items.
- The \(k\)-coloring fitness landscape (Q491197) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Fast algorithms for placing large entries along the diagonal of a sparse matrix (Q708297) (← links)
- Distribution-free testing in linear and parametric regression (Q825054) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- Primal-dual algorithms for the assignment problem (Q1095790) (← links)
- Time-cost tradeoff in a three-dimensional assignment problem (Q1123126) (← links)
- The complexity of computing metric distances between partitions (Q1170849) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- The \(\beta\)-assignment problems (Q1291693) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- The \(\beta\)-assignment problem in general graphs (Q1370666) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- A labeling algorithm for the fuzzy assignment problem. (Q1426740) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching (Q1806920) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
- The assignment problem revisited (Q2136890) (← links)
- Computing the sequence of \(k\)-cardinality assignments (Q2165282) (← links)
- A priority based unbalanced time minimization assignment problem (Q2307977) (← links)
- On a class of assignment problems. (Q2468576) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- Bestimmung eines maximalen Matching in beliebigen Graphen (Q2555874) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Ganzzahlige Programmierungen. Theorie und Anwendungen in der Praxis (Q3270232) (← links)
- Some aspects on solving transportation problem (Q3388797) (← links)
- Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes (Q4969701) (← links)
- (Q5088980) (← links)
- Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs (Q5881094) (← links)
- (Q6081723) (← links)
- Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space (Q6096395) (← links)
- Representation learning for clustering via building consensus (Q6097131) (← links)
- Multi-league sports scheduling with different leagues sizes (Q6106988) (← links)
- Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond (Q6195958) (← links)