- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j10 |      | Gabrio Caimi, Fabián A. Chudak, Martin Fuchsberger, Marco Laumanns, Rico Zenklusen: A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling. Transportation Science 45(2): 212-227 (2011) |
| 2010 | ||
| i2 | | Geordie Rose, Kamran Karimi, Neil G. Dickson, Firas Hamze, M. H. S. Amin, Marshall Drew-Brook, Fabián A. Chudak, Paul I. Bunyk, William G. Macready: Investigating the Performance of an Adiabatic Quantum Optimization Processor. CoRR abs/1006.4147 (2010) |
| 2007 | ||
| c7 | | 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 | ||
| j9 | | Francisco Barahona, Fabián A. Chudak: Near-optimal solutions to large-scale facility location problems. Discrete Optimization 2(1): 35-50 (2005) |
| j8 | | Fabián A. Chudak, David P. Williamson: Improved approximation algorithms for capacitated facility location problems. Math. Program. 102(2): 207-222 (2005) |
| c6 | | Fabián A. Chudak, Vânia Eleutério: Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems. IPCO 2005: 81-96 |
| 2004 | ||
| j7 | | 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) |
| j6 | | 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) |
| 2003 | ||
| j5 | | 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 | ||
| i1 | | 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 | ||
| c5 | | 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 | ||
| j4 | | 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) |
| j3 | | 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) |
| j2 | | 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) |
| c4 | | Fabián A. Chudak, David P. Williamson: Improved Approximation Algorithms for Capacitated Facility Location Problems. IPCO 1999: 99-113 |
| c3 | | Fabián A. Chudak, David B. Shmoys: Improved Approximation Algorithms for a Capacitated Facility Location Problem. SODA 1999: 875-876 |
| 1998 | ||
| j1 | | 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) |
| c2 | | Fabián A. Chudak: Improved Approximation Algorithms for Uncapitated Facility Location. IPCO 1998: 180-194 |
| 1997 | ||
| c1 | | 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 |
Colors in the list of coauthors
Last update Sat May 25 22:37:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page