2007 |
17 | EE | Fabián A. Chudak,
Kiyohito Nagano:
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization.
SODA 2007: 79-88 |
2005 |
16 | EE | Fabián A. Chudak,
Vânia Eleutério:
Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems.
IPCO 2005: 81-96 |
15 | EE | Francisco Barahona,
Fabián A. Chudak:
Near-optimal solutions to large-scale facility location problems.
Discrete Optimization 2(1): 35-50 (2005) |
14 | EE | Fabián A. Chudak,
David P. Williamson:
Improved approximation algorithms for capacitated facility location problems.
Math. Program. 102(2): 207-222 (2005) |
2004 |
13 | EE | Timothy Y. Chow,
Fabián A. Chudak,
Anthony M. Ffrench:
Fast optical layer mesh protection using pre-cross-connected trails.
IEEE/ACM Trans. Netw. 12(3): 539-548 (2004) |
12 | EE | Fabián A. Chudak,
Tim Roughgarden,
David P. Williamson:
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation.
Math. Program. 100(2): 411-421 (2004) |
2003 |
11 | EE | Fabián A. Chudak,
David B. Shmoys:
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem.
SIAM J. Comput. 33(1): 1-25 (2003) |
2002 |
10 | EE | Timothy Y. Chow,
Fabián A. Chudak,
Anthony M. Ffrench:
Fast optical layer mesh protection using pre-cross-connected trails
CoRR cs.NI/0209006: (2002) |
2001 |
9 | EE | Fabián A. Chudak,
Tim Roughgarden,
David P. Williamson:
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation.
IPCO 2001: 60-70 |
1999 |
8 | EE | Fabián A. Chudak,
David P. Williamson:
Improved Approximation Algorithms for Capacitated Facility Location Problems.
IPCO 1999: 99-113 |
7 | EE | Fabián A. Chudak,
David B. Shmoys:
Improved Approximation Algorithms for a Capacitated Facility Location Problem.
SODA 1999: 875-876 |
6 | EE | Karen Aardal,
Fabián A. Chudak,
David B. Shmoys:
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem.
Inf. Process. Lett. 72(5-6): 161-167 (1999) |
5 | | Fabián A. Chudak,
David B. Shmoys:
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds.
J. Algorithms 30(2): 323-343 (1999) |
4 | EE | Fabián A. Chudak,
Dorit S. Hochbaum:
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine.
Oper. Res. Lett. 25(5): 199-204 (1999) |
1998 |
3 | EE | Fabián A. Chudak:
Improved Approximation Algorithms for Uncapitated Facility Location.
IPCO 1998: 180-194 |
2 | EE | Fabián A. Chudak,
Michel X. Goemans,
Dorit S. Hochbaum,
David P. Williamson:
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs.
Oper. Res. Lett. 22(4-5): 111-118 (1998) |
1997 |
1 | | Fabián A. Chudak,
David B. Shmoys:
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract).
SODA 1997: 581-590 |