-
1
-
-
34249952823
-
Optimizing over the Subtour Polytope of the Travelling Salesman Problem
-
S. Boyd and W.R. Pulleyblank, "Optimizing over the Subtour Polytope of the Travelling Salesman Problem", Mathematical Programming, 49, 163-187 (1991).
-
(1991)
Mathematical Programming
, vol.49
, pp. 163-187
-
-
Boyd, S.1
Pulleyblank, W.R.2
-
2
-
-
34250087460
-
A Matroid Algorithm and its Application to the Efficient Solution of Two Optimization Problems on Graphs
-
C. Brezovec, G. Cornuéjols and F. Glover, "A Matroid Algorithm and its Application to the Efficient Solution of Two Optimization Problems on Graphs", Mathematical Programming, 42, 471-487 (1988).
-
(1988)
Mathematical Programming
, vol.42
, pp. 471-487
-
-
Brezovec, C.1
Cornuéjols, G.2
Glover, F.3
-
3
-
-
26944492182
-
-
K. Chaudhuri, S. Rao, S. Riesenfeld and K. Talwar, What would Edmonds do? Augmenting Paths and Witnesses for degree-bounded MSTs, APPROX, 26-39 (2005).
-
K. Chaudhuri, S. Rao, S. Riesenfeld and K. Talwar, "What would Edmonds do? Augmenting Paths and Witnesses for degree-bounded MSTs", APPROX, 26-39 (2005).
-
-
-
-
4
-
-
0022129352
-
The Traveling Salesman Problem on a Graph and some Related Integer Polyhdra
-
G. Cornuéjols, J. Fonlupt and D. Naddef, "The Traveling Salesman Problem on a Graph and some Related Integer Polyhdra", Mathematical Programming, 33, 1-27 (1985).
-
(1985)
Mathematical Programming
, vol.33
, pp. 1-27
-
-
Cornuéjols, G.1
Fonlupt, J.2
Naddef, D.3
-
6
-
-
0002167079
-
Submodular Functions, Matroids, and Certain Polyhedra
-
Gordon and Breach, New York
-
J. Edmonds, "Submodular Functions, Matroids, and Certain Polyhedra", in Combinatorial Structures and Their Applications, Gordon and Breach, New York, 69-87 (1970).
-
(1970)
Combinatorial Structures and Their Applications
, pp. 69-87
-
-
Edmonds, J.1
-
7
-
-
27744567233
-
Matroids and the Greedy Algorithm
-
J. Edmonds, "Matroids and the Greedy Algorithm", Mathematical Programming, 1, 127-136 (1971).
-
(1971)
Mathematical Programming
, vol.1
, pp. 127-136
-
-
Edmonds, J.1
-
9
-
-
0000245114
-
Approximating the Minimum Degree Steiner Tree to Within one of Optimal
-
M. Fürer and B. Raghavachari, "Approximating the Minimum Degree Steiner Tree to Within one of Optimal", Journal of Algorithms, 17, 409-423 (1994).
-
(1994)
Journal of Algorithms
, vol.17
, pp. 409-423
-
-
Fürer, M.1
Raghavachari, B.2
-
10
-
-
0030217630
-
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
-
H.N. Gabow and Y. Xu, "Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems", Journal of Computer and System Sciences, 53, 129-147 (1996).
-
(1996)
Journal of Computer and System Sciences
, vol.53
, pp. 129-147
-
-
Gabow, H.N.1
Xu, Y.2
-
11
-
-
0001050402
-
The Traveling-Salesman and Minimum Cost Spanning Trees
-
M. Held and R. M. Karp, "The Traveling-Salesman and Minimum Cost Spanning Trees", Operations Research, 18, 1138-1162 (1970).
-
(1970)
Operations Research
, vol.18
, pp. 1138-1162
-
-
Held, M.1
Karp, R.M.2
-
12
-
-
34250461535
-
The Traveling-Salesman and Minimum Cost Spanning Trees: Part II
-
M. Held and R. M. Karp, "The Traveling-Salesman and Minimum Cost Spanning Trees: Part II", Mathematical Programming, 1, 6-25 (1971).
-
(1971)
Mathematical Programming
, vol.1
, pp. 6-25
-
-
Held, M.1
Karp, R.M.2
-
13
-
-
38749155036
-
On the Degrees of the Vertices of a Directed Graph
-
S.L. Hakimi, "On the Degrees of the Vertices of a Directed Graph", Journal of the Franklin Institute, 279, 139-154 (1965).
-
(1965)
Journal of the Franklin Institute
, vol.279
, pp. 139-154
-
-
Hakimi, S.L.1
-
14
-
-
38749154471
-
An Algebraic Algorithm for Weighted Linear Matroid Intersection
-
manuscript, July
-
N. Harvey, "An Algebraic Algorithm for Weighted Linear Matroid Intersection", manuscript, July 2006.
-
(2006)
-
-
Harvey, N.1
-
16
-
-
77956098092
-
How to Tidy Up your Set System?
-
North-Holland
-
C.A.J. Hurkens, L. Lovász, A. Schrijver and É Tardos, "How to Tidy Up your Set System?", in: Combinatorics, Colloquia Mathematica Societatis János Bolyai, 52, North-Holland, 309-314 (1998).
-
(1998)
Combinatorics, Colloquia Mathematica Societatis János Bolyai
, vol.52
, pp. 309-314
-
-
Hurkens, C.A.J.1
Lovász, L.2
Schrijver, A.3
Tardos, E.4
-
17
-
-
0005363324
-
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
-
K. Jain, "A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem", Combinatorica, 21, 39-60 (2001).
-
(2001)
Combinatorica
, vol.21
, pp. 39-60
-
-
Jain, K.1
-
18
-
-
0036766890
-
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
-
J. Könemann and R. Ravi, "A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees", SIAM J. Computing, 31, 1783-1793 (2002).
-
(2002)
SIAM J. Computing
, vol.31
, pp. 1783-1793
-
-
Könemann, J.1
Ravi, R.2
-
19
-
-
0038107646
-
-
J. Könemann and R. Ravi, Primal-Dual Meets Local Search: Approximating MST's with Nonuniform Degree Bounds, SIAM J. on Computing, to appear. Preliminary version in STOC 2003, pp. 389-395.
-
J. Könemann and R. Ravi, "Primal-Dual Meets Local Search: Approximating MST's with Nonuniform Degree Bounds", SIAM J. on Computing, to appear. Preliminary version in STOC 2003, pp. 389-395.
-
-
-
-
20
-
-
0014856102
-
On Graphs and Rigidity of Plane Skeletal Structures
-
G. Laman, "On Graphs and Rigidity of Plane Skeletal Structures", Journal of Engineering Mathematics, 4 331-340 (1970).
-
(1970)
Journal of Engineering Mathematics
, vol.4
, pp. 331-340
-
-
Laman, G.1
-
21
-
-
0016536930
-
Matroid Intersection Algorithms
-
E.L. Lawler, "Matroid Intersection Algorithms", Mathematical Programming, 9, 31-56 (1975).
-
(1975)
Mathematical Programming
, vol.9
, pp. 31-56
-
-
Lawler, E.L.1
-
24
-
-
33746354336
-
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
-
R. Ravi and M. Singh, "Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs", Proceedings of ICALP, 169-180 (2006).
-
(2006)
Proceedings of ICALP
, pp. 169-180
-
-
Ravi, R.1
Singh, M.2
|