default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabián A. Chudak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti:
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results. Inf. Comput. 275: 104609 (2020)
2010 – 2019
- 2018
- [i4]Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti:
Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results. CoRR abs/1811.02524 (2018) - 2017
- [c8]Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti:
Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report. FroCoS 2017: 153-171 - 2016
- [j12]Zhengbing Bian, Fabián A. Chudak, Robert B. Israel, Brad Lackey, William G. Macready, Aidan Roy:
Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis. Frontiers ICT 3: 14 (2016) - [i3]Dmytro Korenkevych, Yanbo Xue
, Zhengbing Bian, Fabián A. Chudak, William G. Macready, Jason Rolfe, Evgeny Andriyash:
Benchmarking Quantum Hardware for Training of Fully Visible Boltzmann Machines. CoRR abs/1611.04528 (2016) - 2012
- [j11]Kamran Karimi, Neil G. Dickson, Firas Hamze, Mohammad H. S. Amin, Marshall Drew-Brook, Fabián A. Chudak, Paul I. Bunyk, William G. Macready, Geordie Rose:
Investigating the performance of an adiabatic quantum optimization processor. Quantum Inf. Process. 11(1): 77-88 (2012) - 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. Transp. Sci. 45(2): 212-227 (2011) - 2010
- [i2]Geordie Rose, Kamran Karimi, Neil G. Dickson, Firas Hamze, Mohammad 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)
2000 – 2009
- 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. Discret. Optim. 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
1990 – 1999
- 1999
- [j4]Karen I. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
