AAAAAA

   
Results: 1-15 |
Results: 15
PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR FEEDBACK PROBLEMS IN PLANAR GRAPHS
Authors: GOEMANS MX WILLIAMSON DP
Citation: Mx. Goemans et Dp. Williamson, PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR FEEDBACK PROBLEMS IN PLANAR GRAPHS, Combinatorica, 18(1), 1998, pp. 37-59
A PRIMAL-DUAL INTERPRETATION OF 2 2-APPROXIMATION ALGORITHMS FOR THE FEEDBACK VERTEX SET PROBLEM IN UNDIRECTED GRAPHS
Authors: CHUDAK FA GOEMANS MX HOCHBAUM DS WILLIAMSON DP
Citation: Fa. Chudak et al., A PRIMAL-DUAL INTERPRETATION OF 2 2-APPROXIMATION ALGORITHMS FOR THE FEEDBACK VERTEX SET PROBLEM IN UNDIRECTED GRAPHS, Operations research letters, 22(4-5), 1998, pp. 111-118
AN EFFICIENT APPROXIMATION ALGORITHM FOR THE SURVIVABLE NETWORK DESIGN PROBLEM
Authors: GABOW HN GOEMANS MX WILLIAMSON DP
Citation: Hn. Gabow et al., AN EFFICIENT APPROXIMATION ALGORITHM FOR THE SURVIVABLE NETWORK DESIGN PROBLEM, Mathematical programming, 82(1-2), 1998, pp. 13-40
AN APPROXIMATION ALGORITHM FOR MINIMUM-COST VERTEX-CONNECTIVITY PROBLEMS
Authors: RAVI R WILLIAMSON DP
Citation: R. Ravi et Dp. Williamson, AN APPROXIMATION ALGORITHM FOR MINIMUM-COST VERTEX-CONNECTIVITY PROBLEMS, Algorithmica, 18(1), 1997, pp. 21-43
SHORT SHOP SCHEDULES
Authors: WILLIAMSON DP HALL LA HOOGEVEEN JA HURKENS CAJ LENSTRA JK SEVASTJANOV SV SHMOYS DB
Citation: Dp. Williamson et al., SHORT SHOP SCHEDULES, Operations research, 45(2), 1997, pp. 288-294
APPROXIMATION ALGORITHMS
Authors: SCHULZ AS SHMOYS DB WILLIAMSON DP
Citation: As. Schulz et al., APPROXIMATION ALGORITHMS, Proceedings of the National Academy of Sciences of the United Statesof America, 94(24), 1997, pp. 12734-12735
ON THE NUMBER OF SMALL CUTS IN A GRAPH
Authors: HENZINGER M WILLIAMSON DP
Citation: M. Henzinger et Dp. Williamson, ON THE NUMBER OF SMALL CUTS IN A GRAPH, Information processing letters, 59(1), 1996, pp. 41-44
SOLITARY NEUROFIBROMA OF THE GALLBLADDER
Authors: KING K WILLIAMSON DP
Citation: K. King et Dp. Williamson, SOLITARY NEUROFIBROMA OF THE GALLBLADDER, Journal of ultrasound in medicine, 14(4), 1995, pp. 315-316
SCHEDULING PARALLEL MACHINES ONLINE
Authors: SHMOYS DB WEIN J WILLIAMSON DP
Citation: Db. Shmoys et al., SCHEDULING PARALLEL MACHINES ONLINE, SIAM journal on computing, 24(6), 1995, pp. 1313-1331
A GENERAL APPROXIMATION TECHNIQUE FOR CONSTRAINED FOREST PROBLEMS
Authors: GOEMANS MX WILLIAMSON DP
Citation: Mx. Goemans et Dp. Williamson, A GENERAL APPROXIMATION TECHNIQUE FOR CONSTRAINED FOREST PROBLEMS, SIAM journal on computing, 24(2), 1995, pp. 296-317
PITFALLS OF MEDICAL LEADERSHIP
Authors: WILLIAMSON DP
Citation: Dp. Williamson, PITFALLS OF MEDICAL LEADERSHIP, Postgraduate medicine, 97(4), 1995, pp. 32-32
IMPROVED APPROXIMATION ALGORITHMS FOR MAXIMUM CUT AND SATISFIABILITY PROBLEMS USING SEMIDEFINITE PROGRAMMING
Authors: GOEMANS MX WILLIAMSON DP
Citation: Mx. Goemans et Dp. Williamson, IMPROVED APPROXIMATION ALGORITHMS FOR MAXIMUM CUT AND SATISFIABILITY PROBLEMS USING SEMIDEFINITE PROGRAMMING, Journal of the Association for Computing Machinery, 42(6), 1995, pp. 1115-1145
NEW 3 4-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM/
Authors: GOEMANS MX WILLIAMSON DP
Citation: Mx. Goemans et Dp. Williamson, NEW 3 4-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM/, SIAM journal on discrete mathematics, 7(4), 1994, pp. 656-666
NEW 3 4-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM/
Authors: GOEMANS MX WILLIAMSON DP
Citation: Mx. Goemans et Dp. Williamson, NEW 3 4-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM/, SIAM journal on discrete mathematics, 7(4), 1994, pp. 656-666
APPROXIMATING MINIMUM-COST GRAPH PROBLEMS WITH SPANNING TREE EDGES
Authors: GOEMANS MX WILLIAMSON DP
Citation: Mx. Goemans et Dp. Williamson, APPROXIMATING MINIMUM-COST GRAPH PROBLEMS WITH SPANNING TREE EDGES, Operations research letters, 16(4), 1994, pp. 183-189
Risultati: 1-15 |