dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Fabián A. Chudak Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGabrio 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
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeordie 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
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabiá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
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabián A. Chudak, Vânia Eleutério: Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems. IPCO 2005: 81-96
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancisco Barahona, Fabián A. Chudak: Near-optimal solutions to large-scale facility location problems. Discrete Optimization 2(1): 35-50 (2005)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabián A. Chudak, David P. Williamson: Improved approximation algorithms for capacitated facility location problems. Math. Program. 102(2): 207-222 (2005)
2004
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy 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)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabiá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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabián A. Chudak, David B. Shmoys: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. SIAM J. Comput. 33(1): 1-25 (2003)
2002
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabiá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
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabián A. Chudak, David P. Williamson: Improved Approximation Algorithms for Capacitated Facility Location Problems. IPCO 1999: 99-113
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabián A. Chudak, David B. Shmoys: Improved Approximation Algorithms for a Capacitated Facility Location Problem. SODA 1999: 875-876
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKaren 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)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabiá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)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabiá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
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabián A. Chudak: Improved Approximation Algorithms for Uncapitated Facility Location. IPCO 1998: 180-194
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabiá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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabiá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

Coauthor Index

1Karen Aardal [6]
2M. H. S. Amin [18]
3Francisco Barahona [15]
4Paul I. Bunyk [18]
5Gabrio Curzio Caimi (Gabrio Caimi) [19]
6Timothy Y. Chow [10] [13]
7Neil G. Dickson [18]
8Marshall Drew-Brook [18]
9Vânia Eleutério [16]
10Anthony M. Ffrench [10] [13]
11Martin Fuchsberger [19]
12Michel X. Goemans [2]
13Firas Hamze [18]
14Dorit S. Hochbaum [2] [4]
15Kamran Karimi [18]
16Marco Laumanns [19]
17William G. Macready [18]
18Kiyohito Nagano [17]
19Geordie Rose [18]
20Tim Roughgarden [9] [12]
21David B. Shmoys [1] [5] [6] [7] [11]
22David P. Williamson [2] [8] [9] [12] [14]
23Rico Zenklusen [19]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page