The following pages link to (Q3048571):
Displaying 50 items.
- The shortest path problem with two objective functions (Q1077332) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← links)
- Optimal precision in the presence of uncertainty (Q1079953) (← links)
- A comment on \('''NP=P?'\) and restricted partitions'' (Q1083850) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- A decomposition theory for matroids. III. Decomposition conditions (Q1086242) (← links)
- On lattices with Möbius function \(\pm 1,0\) (Q1087570) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- On the maximum 2-1 matching (Q1095813) (← links)
- Shortest-path problems and molecular conformation (Q1095924) (← links)
- Order statistics and the linear assignment problem (Q1098186) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- The strong chromatic number of partial triple systems (Q1101122) (← links)
- Approximation algorithms for weighted matching (Q1102118) (← links)
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- The complexity of computing best-response automata in repeated games (Q1106110) (← links)
- A polynomial algorithm for b-matchings: An alternative approach (Q1109690) (← links)
- Lower bounds on two-terminal network reliability (Q1116878) (← links)
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893) (← links)
- Large-scale network analysis with applications to transportation, communication and inference networks (Q1117845) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- The complexity of matching with bonds (Q1123620) (← links)
- The minimal average cost flow problem (Q1130071) (← links)
- On maximal independent sets of vertices in claw-free graphs (Q1139605) (← links)
- Combinatorial problems over power sets (Q1143948) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- An algorithm for generating all maximal independent subsets of posets (Q1147517) (← links)
- Worst case bounds for the Euclidean matching problem (Q1149255) (← links)
- Discrete extremal problems (Q1152306) (← links)
- An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems (Q1159133) (← links)
- On factors in random graphs (Q1159696) (← links)
- Parallel algorithms for the single source shortest path problem (Q1162156) (← links)
- Hybrid algorithm for sequencing with bicriteria (Q1162274) (← links)
- How to make a digraph strongly connected (Q1165251) (← links)
- An NP-complete matching problem (Q1166935) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- The complexity of computing metric distances between partitions (Q1170849) (← links)
- The complexity of controlled selection (Q1173958) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Cooperative games arising from network flow problems (Q1178645) (← links)
- Polymatroids: Construction and random algorithms (Q1179434) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- A fast algorithm for the generalized parametric minimum cut problem and applications (Q1186785) (← links)
- A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
- Minimum spectral radius of a weighted graph (Q1188417) (← links)
