|
7711
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
971
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
804
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
782
|
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2. SpringerVerlag
– Grötschel, Lovász, et al.
- 1988
|
|
338
|
Combinatorial Optimization: Networks and Matroids
– Lawler
- 1976
|
|
313
|
Matching Theory
– Lovász, Plummer
- 1986
|
|
273
|
The Traveling Salesman problem
– Lawler, Lenstra
- 1984
|
|
195
|
Maximum matching and polyhedron with 0, 1-vertices
– Edmonds
- 1965
|
|
162
|
Multi-commodity network flows
– Hu
- 1963
|
|
140
|
Partitioning procedures for solving mixed-variables programming problems
– Benders
- 1962
|
|
136
|
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
– Agrawal, Klein, et al.
- 1995
|
|
130
|
Steiner problem in networks: a survey
– Winter
- 1987
|
|
101
|
Edmonds polytopes and a hierarchy of combinatorial problems
– Chvátal
- 1973
|
|
87
|
The complexity of facets (and some facets of complexity
– Papadimitriou, Yannakakis
- 1984
|
|
81
|
Tarjan, Augmentation problems
– Eswaran, E
- 1976
|
|
75
|
Odd minimum cut-sets and b-matchings
– Padberg, Rao
- 1982
|
|
73
|
Augmenting Graphs to Meet Edge-Connectivity Requirements
– Frank
- 1992
|
|
58
|
Biconnectivity approximations and graph carvings
– Khuller, Vishkin
- 1994
|
|
54
|
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
– GRÖTSCHEL, MONMA, et al.
- 1992
|
|
51
|
Design of Survivable Networks
– Stoer
- 1992
|
|
46
|
A reduction method for edge-connectivity in graphs
– Mader
- 1978
|
|
41
|
Implementing the Simplex Method: The Initial Basis
– Bixby
- 1990
|
|
41
|
The Traveling Salesman Problem on a Graph and Some
– Cornuéjols, Fonlupt, et al.
- 1985
|
|
41
|
Methods for Designing Communication Networks with Certain Two-Connected Survivability Constraints
– MONMA, SHALLCROSS
- 1989
|
|
40
|
Survivable networks, linear programming relaxations and the parsimonious property
– Goemans, Bertsimas
- 1993
|
|
40
|
Edge-Connectivity Augmentation Problems
– Watanabe, Nakamura
- 1987
|
|
37
|
A faster algorithm for finding the minimum cut in a graph
– Hao, Orlin
- 1992
|
|
33
|
Minimum-weight two-connected spanning networks
– Monma, Munson, et al.
- 1990
|
|
32
|
Polyhedral theory
– Grotschel, Padberg
- 1985
|
|
32
|
The design of minimum-cost survivable networks
– Stiglitz, Weiner, et al.
- 1969
|
|
29
|
Linear-time computability of combinatorial problems on series-parallel graphs
– Takamizawa, Nishizeki, et al.
- 1982
|
|
25
|
On the relationship between the biconnectivity augmentation and traveling salesman problems
– Frederickson, J'aJ'a
- 1982
|
|
24
|
Polyhedral Combinatorics
– Pulleyblank
- 1983
|
|
21
|
The maximum connectivity of a graph
– Harary
- 1962
|
|
20
|
Smallest augmentations to biconnect a graph
– Rosenthal, Goldner
- 1977
|
|
18
|
Integer polyhedra associated with certain network design problems with connectivity constraints
– Grötschel, Monma
- 1990
|
|
18
|
A fast algorithm for optimally increasing the edge-connectivity
– Naor, Gusfield, et al.
- 1990
|
|
17
|
On the structure of minimum-weight k-connected spanning networks
– Bienstock, Brickell, et al.
- 1990
|
|
17
|
On some connectivity properties of Eulerian graphs
– Lovász
- 1976
|
|
16
|
Facets for polyhedra arising in the design of communication networks with low-connectivity constraints
– Grotschel, Monma, et al.
- 1992
|
|
15
|
Polyhedral and computational investigations for designing communication networks with high survivability requirements”, Operations Research 43
– Grötschel, Monma, et al.
- 1995
|
|
14
|
Connectivity considerations in the design of survivable networks
– Frank, Chou
- 1970
|
|
11
|
Survivable Network Architectures for Broad-Band Fiber Optic Networks: Model and Performance Comparison
– Wu, Kolar, et al.
- 1988
|
|
10
|
Computer-aided design procedures for survivable fiber optic networks
– Cardwell, Monma, et al.
- 1989
|
|
10
|
Generalized Steiner problem in series-parallel networks
– Winter
- 1986
|
|
9
|
Two terminal Steiner tree polyhedra
– BALL, LIU, et al.
- 1989
|
|
9
|
Steiner trees, partial 2-trees, and minimum IFI networks
– Wald, Colbourn
- 1983
|
|
8
|
Two-edge connected spanning subgraphs and polyhedra
– Mahjoub
- 1994
|
|
8
|
Generalized Steiner problem in outerplanar networks
– Winter
- 1987
|
|
6
|
Survivable communication networks and the terminal capacity matrix
– Chou, Frank
- 1970
|
|
