The following pages link to (Q3138921):
Displaying 50 items.
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Optimal on-line decremental connectivity in trees (Q290266) (← links)
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← links)
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Computing convex quadrangulations (Q412380) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Weighted well-covered claw-free graphs (Q482209) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
- Age-based preferences in paired kidney exchange (Q523519) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Computing solutions for matching games (Q662281) (← links)
- Maintenance of 2- and 3-edge-connected components of graphs. I (Q685694) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- Incremental assignment problem (Q865928) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings (Q976131) (← links)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- A simple approximation algorithm for the weighted matching problem (Q1007528) (← links)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- Lexicographic bottleneck combinatorial problems (Q1306468) (← links)
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← links)
- An optimal algorithm for plane matchings in multipartite geometric graphs (Q1616235) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem (Q1752857) (← links)
- A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
- A 3/2-approximation for big two-bar charts packing (Q2045041) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
