Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Dorit S. Hochbaum
@inproceedings{DBLP:conf/icpram/NitayanontLH24,
author = {Torpong Nitayanont and
Cheng Lu and
Dorit S. Hochbaum},
editor = {Modesto Castrill{\'{o}}n Santana and
Maria De Marsico and
Ana L. N. Fred},
title = {Path of Solutions for Fused Lasso Problems},
booktitle = {Proceedings of the 13th International Conference on Pattern Recognition
Applications and Methods, {ICPRAM} 2024, Rome, Italy, February 24-26,
2024},
pages = {107--118},
publisher = {{SCITEPRESS}},
year = {2024},
url = {https://doi.org/10.5220/0012433200003654},
doi = {10.5220/0012433200003654},
timestamp = {Tue, 02 Apr 2024 14:39:54 +0200},
biburl = {https://dblp.org/rec/conf/icpram/NitayanontLH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-07341,
author = {Dorit S. Hochbaum},
title = {Binary weights spanning trees and the k-red spanning tree problem
in linear time},
journal = {CoRR},
volume = {abs/2401.07341},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.07341},
doi = {10.48550/ARXIV.2401.07341},
eprinttype = {arXiv},
eprint = {2401.07341},
timestamp = {Thu, 01 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-07341.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/SchobelPH23,
author = {Anita Sch{\"{o}}bel and
David Pisinger and
Dorit S. Hochbaum},
title = {Obituary for Professor Emeritus Jakob Kraurp},
journal = {Eur. J. Oper. Res.},
volume = {310},
number = {1},
pages = {1--2},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.03.029},
doi = {10.1016/J.EJOR.2023.03.029},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/SchobelPH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acda/HochbaumLG23,
author = {Dorit S. Hochbaum and
Zhihao Liu and
Olivier Goldschmidt},
editor = {Jonathan W. Berry and
David B. Shmoys and
Lenore Cowen and
Uwe Naumann},
title = {A Breakpoints Based Method for the Maximum Diversity and Dispersion
Problems},
booktitle = {{SIAM} Conference on Applied and Computational Discrete Algorithms,
{ACDA} 2023, Seattle, WA, USA, May 31 - June 2, 2023},
pages = {189--200},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977714.17},
doi = {10.1137/1.9781611977714.17},
timestamp = {Tue, 17 Oct 2023 16:38:11 +0200},
biburl = {https://dblp.org/rec/conf/acda/HochbaumLG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ic3k/Hochbaum23,
author = {Dorit S. Hochbaum},
editor = {Ana L. N. Fred and
Frans Coenen and
Jorge Bernardino},
title = {Unified New Techniques for NP-Hard Budgeted Problems with Applications
in Team Collaboration, Pattern Recognition, Document Summarization,
Community Detection and Imaging},
booktitle = {Proceedings of the 15th International Joint Conference on Knowledge
Discovery, Knowledge Engineering and Knowledge Management, {IC3K}
2023, Volume 1: KDIR, Rome, Italy, November 13-15, 2023},
pages = {365--372},
publisher = {{SCITEPRESS}},
year = {2023},
url = {https://doi.org/10.5220/0012207200003598},
doi = {10.5220/0012207200003598},
timestamp = {Fri, 08 Dec 2023 12:37:31 +0100},
biburl = {https://dblp.org/rec/conf/ic3k/Hochbaum23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-15702,
author = {Nathan Atkinson and
Scott C. Ganz and
Dorit S. Hochbaum and
James B. Orlin},
title = {The Strong Maximum Circulation Algorithm: {A} New Method for Aggregating
Preference Rankings},
journal = {CoRR},
volume = {abs/2307.15702},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.15702},
doi = {10.48550/ARXIV.2307.15702},
eprinttype = {arXiv},
eprint = {2307.15702},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-15702.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-03924,
author = {Catalina Pezo and
Dorit S. Hochbaum and
Julio Godoy and
Roberto Javier {As{'{i}}n Ach{'{a}}}},
title = {Automatic Algorithm Selection for Pseudo-Boolean Optimization with
Given Computational Time Limits},
journal = {CoRR},
volume = {abs/2309.03924},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.03924},
doi = {10.48550/ARXIV.2309.03924},
eprinttype = {arXiv},
eprint = {2309.03924},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-03924.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HochbaumRS22,
author = {Dorit S. Hochbaum and
Xu Rao and
Jason J. Sauppe},
title = {Network flow methods for the minimum covariate imbalance problem},
journal = {Eur. J. Oper. Res.},
volume = {300},
number = {3},
pages = {827--836},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.10.041},
doi = {10.1016/J.EJOR.2021.10.041},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/HochbaumRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/VelednitskyH22,
author = {Mark Velednitsky and
Dorit S. Hochbaum},
title = {Isolation branching: a branch and bound algorithm for the k-terminal
cut problem},
journal = {J. Comb. Optim.},
volume = {44},
number = {3},
pages = {1659--1679},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00534-y},
doi = {10.1007/S10878-020-00534-Y},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/VelednitskyH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LuH22,
author = {Cheng Lu and
Dorit S. Hochbaum},
title = {A unified approach for a 1D generalized total variation problem},
journal = {Math. Program.},
volume = {194},
number = {1},
pages = {415--442},
year = {2022},
url = {https://doi.org/10.1007/s10107-021-01633-2},
doi = {10.1007/S10107-021-01633-2},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/LuH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sncs/BodineH22,
author = {Jonathan Bodine and
Dorit S. Hochbaum},
title = {A Better Decision Tree: The Max-Cut Decision Tree with Modified {PCA}
Improves Accuracy and Running Time},
journal = {{SN} Comput. Sci.},
volume = {3},
number = {4},
pages = {313},
year = {2022},
url = {https://doi.org/10.1007/s42979-022-01147-4},
doi = {10.1007/S42979-022-01147-4},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sncs/BodineH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ic3k/AchaGHH22,
author = {Roberto Javier {As{'{i}}n Ach{'{a}}} and
Olivier Goldschmidt and
Dorit S. Hochbaum and
Isa{\'{\i}}as I. Huerta},
editor = {Frans Coenen and
Ana L. N. Fred and
Joaquim Filipe},
title = {Fast Algorithms for the Capacitated Vehicle Routing Problem using
Machine Learning Selection of Algorithm's Parameters},
booktitle = {Proceedings of the 14th International Joint Conference on Knowledge
Discovery, Knowledge Engineering and Knowledge Management, {IC3K}
2022, Volume 1: KDIR, Valletta, Malta, October 24-26, 2022},
pages = {29--39},
publisher = {{SCITEPRESS}},
year = {2022},
url = {https://doi.org/10.5220/0011405400003335},
doi = {10.5220/0011405400003335},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ic3k/AchaGHH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpram/BaumannH22,
author = {Philipp Baumann and
Dorit S. Hochbaum},
editor = {Maria De Marsico and
Gabriella Sanniti di Baja and
Ana L. N. Fred},
title = {A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link
Constraints},
booktitle = {Proceedings of the 11th International Conference on Pattern Recognition
Applications and Methods, {ICPRAM} 2022, Online Streaming, February
3-5, 2022},
pages = {195--202},
publisher = {{SCITEPRESS}},
year = {2022},
url = {https://doi.org/10.5220/0010800000003122},
doi = {10.5220/0010800000003122},
timestamp = {Tue, 06 Jun 2023 14:58:01 +0200},
biburl = {https://dblp.org/rec/conf/icpram/BaumannH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-14437,
author = {Philipp Baumann and
Dorit S. Hochbaum},
title = {{PCCC:} The Pairwise-Confidence-Constraints-Clustering Algorithm},
journal = {CoRR},
volume = {abs/2212.14437},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.14437},
doi = {10.48550/ARXIV.2212.14437},
eprinttype = {arXiv},
eprint = {2212.14437},
timestamp = {Sun, 08 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-14437.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hochbaum21,
author = {Dorit S. Hochbaum},
title = {Applications and efficient algorithms for integer programming problems
on monotone constraints},
journal = {Networks},
volume = {77},
number = {1},
pages = {21--49},
year = {2021},
url = {https://doi.org/10.1002/net.21983},
doi = {10.1002/NET.21983},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Hochbaum21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HochbaumLR21,
author = {Dorit S. Hochbaum and
Asaf Levin and
Xu Rao},
title = {Complexity, algorithms and applications of the integer network flow
with fractional supplies problem},
journal = {Oper. Res. Lett.},
volume = {49},
number = {4},
pages = {559--564},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.06.003},
doi = {10.1016/J.ORL.2021.06.003},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HochbaumLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-04765,
author = {Dorit S. Hochbaum and
Erick Moreno{-}Centeno},
title = {Joint aggregation of cardinal and ordinal evaluations with an application
to a student paper competition},
journal = {CoRR},
volume = {abs/2101.04765},
year = {2021},
url = {https://arxiv.org/abs/2101.04765},
eprinttype = {arXiv},
eprint = {2101.04765},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-04765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/AchaHS20,
author = {Roberto Javier {As{'{i}}n Ach{'{a}}} and
Dorit S. Hochbaum and
Quico Spaen},
title = {HNCcorr: combinatorial optimization for neuron identification},
journal = {Ann. Oper. Res.},
volume = {289},
number = {1},
pages = {5--32},
year = {2020},
url = {https://doi.org/10.1007/s10479-019-03464-z},
doi = {10.1007/S10479-019-03464-Z},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/AchaHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HochbaumR20,
author = {Dorit S. Hochbaum and
Xu Rao},
title = {Approximation algorithms for connected maximum coverage problem for
the discovery of mutated driver pathways in cancer},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105940},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105940},
doi = {10.1016/J.IPL.2020.105940},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HochbaumR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChangHSV20,
author = {Minjun Chang and
Dorit S. Hochbaum and
Quico Spaen and
Mark Velednitsky},
title = {An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite
Matching with i.i.d. Arrivals},
journal = {Theory Comput. Syst.},
volume = {64},
number = {4},
pages = {645--661},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09947-7},
doi = {10.1007/S00224-019-09947-7},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChangHSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HochbaumR20,
author = {Dorit S. Hochbaum and
Xu Rao},
title = {A fully polynomial time approximation scheme for the Replenishment
Storage problem},
journal = {Oper. Res. Lett.},
volume = {48},
number = {6},
pages = {835--839},
year = {2020},
url = {https://doi.org/10.1016/j.orl.2020.10.004},
doi = {10.1016/J.ORL.2020.10.004},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HochbaumR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/HochbaumL20,
author = {Dorit S. Hochbaum and
Cheng Lu},
title = {Erratum: {A} Faster Algorithm Solving a Generalization of Isotonic
Median Regression and a Class of Fused Lasso Problems},
journal = {{SIAM} J. Optim.},
volume = {30},
number = {1},
pages = {1048},
year = {2020},
url = {https://doi.org/10.1137/18M1175495},
doi = {10.1137/18M1175495},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/HochbaumL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ic3k/BodineH20,
author = {Jonathan Bodine and
Dorit S. Hochbaum},
editor = {Ana L. N. Fred and
Joaquim Filipe},
title = {The Max-Cut Decision Tree: Improving on the Accuracy and Running Time
of Decision Trees},
booktitle = {Proceedings of the 12th International Joint Conference on Knowledge
Discovery, Knowledge Engineering and Knowledge Management, {IC3K}
2020, Volume 1: KDIR, Budapest, Hungary, November 2-4, 2020},
pages = {59--70},
publisher = {{SCITEPRESS}},
year = {2020},
url = {https://doi.org/10.5220/0010107400590070},
doi = {10.5220/0010107400590070},
timestamp = {Tue, 06 Jun 2023 14:58:01 +0200},
biburl = {https://dblp.org/rec/conf/ic3k/BodineH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-14118,
author = {Jonathan Bodine and
Dorit S. Hochbaum},
title = {The Max-Cut Decision Tree: Improving on the Accuracy and Running Time
of Decision Trees},
journal = {CoRR},
volume = {abs/2006.14118},
year = {2020},
url = {https://arxiv.org/abs/2006.14118},
eprinttype = {arXiv},
eprint = {2006.14118},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-14118.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-06828,
author = {Dorit S. Hochbaum and
Xu Rao},
title = {Network Flow Methods for the Minimum Covariates Imbalance Problem},
journal = {CoRR},
volume = {abs/2007.06828},
year = {2020},
url = {https://arxiv.org/abs/2007.06828},
eprinttype = {arXiv},
eprint = {2007.06828},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-06828.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-08172,
author = {Dorit S. Hochbaum and
Asaf Levin and
Xu Rao},
title = {Algorithms and Complexity for Variants of Covariates Fine Balance},
journal = {CoRR},
volume = {abs/2009.08172},
year = {2020},
url = {https://arxiv.org/abs/2009.08172},
eprinttype = {arXiv},
eprint = {2009.08172},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-08172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-01631,
author = {Dorit S. Hochbaum and
Xu Rao},
title = {A Fully Polynomial Time Approximation Scheme for the Replenishment
Storage Problem},
journal = {CoRR},
volume = {abs/2010.01631},
year = {2020},
url = {https://arxiv.org/abs/2010.01631},
eprinttype = {arXiv},
eprint = {2010.01631},
timestamp = {Mon, 12 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-01631.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BaumannHY19,
author = {Philipp Baumann and
Dorit S. Hochbaum and
Yan T. Yang},
title = {A comparative study of the leading machine learning techniques and
two new optimization algorithms},
journal = {Eur. J. Oper. Res.},
volume = {272},
number = {3},
pages = {1041--1057},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2018.07.009},
doi = {10.1016/J.EJOR.2018.07.009},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BaumannHY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HochbaumR19,
author = {Dorit S. Hochbaum and
Xu Rao},
title = {The Replenishment Schedule to Minimize Peak Storage Problem: The Gap
Between the Continuous and Discrete Versions of the Problem},
journal = {Oper. Res.},
volume = {67},
number = {5},
pages = {1345--1361},
year = {2019},
url = {https://doi.org/10.1287/opre.2018.1839},
doi = {10.1287/OPRE.2018.1839},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HochbaumR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hochbaum19,
author = {Dorit S. Hochbaum},
title = {Algorithms and complexity of range clustering},
journal = {Networks},
volume = {73},
number = {2},
pages = {170--186},
year = {2019},
url = {https://doi.org/10.1002/net.21854},
doi = {10.1002/NET.21854},
timestamp = {Wed, 27 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Hochbaum19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/BassoHV19,
author = {Rebecca Sarto Basso and
Dorit S. Hochbaum and
Fabio Vandin},
title = {Efficient algorithms to discover alterations with complementary functional
association in cancer},
journal = {PLoS Comput. Biol.},
volume = {15},
number = {5},
year = {2019},
url = {https://doi.org/10.1371/journal.pcbi.1006802},
doi = {10.1371/JOURNAL.PCBI.1006802},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ploscb/BassoHV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ic3k/HochbaumSV19,
author = {Dorit S. Hochbaum and
Quico Spaen and
Mark Velednitsky},
editor = {Ana L. N. Fred and
Joaquim Filipe},
title = {Detecting Aberrant Linking Behavior in Directed Networks},
booktitle = {Proceedings of the 11th International Joint Conference on Knowledge
Discovery, Knowledge Engineering and Knowledge Management, {IC3K}
2019, Volume 1: KDIR, Vienna, Austria, September 17-19, 2019},
pages = {72--82},
publisher = {ScitePress},
year = {2019},
url = {https://doi.org/10.5220/0008069600720082},
doi = {10.5220/0008069600720082},
timestamp = {Tue, 06 Jun 2023 14:58:01 +0200},
biburl = {https://dblp.org/rec/conf/ic3k/HochbaumSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hochbaum18,
author = {Dorit S. Hochbaum},
title = {Complexity and approximations for submodular minimization problems
on two variables per inequality constraints},
journal = {Discret. Appl. Math.},
volume = {250},
pages = {252--261},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.04.012},
doi = {10.1016/J.DAM.2018.04.012},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hochbaum18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HochbaumL18,
author = {Dorit S. Hochbaum and
Sheng Liu},
title = {Adjacency-Clustering and Its Application for Yield Prediction in Integrated
Circuit Manufacturing},
journal = {Oper. Res.},
volume = {66},
number = {6},
pages = {1571--1585},
year = {2018},
url = {https://doi.org/10.1287/opre.2018.1741},
doi = {10.1287/OPRE.2018.1741},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HochbaumL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/HochbaumL18,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {Weighted matching with pair restrictions},
journal = {Optim. Lett.},
volume = {12},
number = {3},
pages = {649--659},
year = {2018},
url = {https://doi.org/10.1007/s11590-017-1217-7},
doi = {10.1007/S11590-017-1217-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/HochbaumL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/VelednitskyH18,
author = {Mark Velednitsky and
Dorit S. Hochbaum},
editor = {Donghyun Kim and
R. N. Uma and
Alexander Zelikovsky},
title = {Isolation Branching: {A} Branch and Bound Algorithm for the k-Terminal
Cut Problem},
booktitle = {Combinatorial Optimization and Applications - 12th International Conference,
{COCOA} 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11346},
pages = {624--639},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04651-4\_42},
doi = {10.1007/978-3-030-04651-4\_42},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/VelednitskyH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/BassoHV18,
author = {Rebecca Sarto Basso and
Dorit S. Hochbaum and
Fabio Vandin},
editor = {Benjamin J. Raphael},
title = {Efficient Algorithms to Discover Alterations with Complementary Functional
Association in Cancer},
booktitle = {Research in Computational Molecular Biology - 22nd Annual International
Conference, {RECOMB} 2018, Paris, France, April 21-24, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10812},
pages = {278--279},
publisher = {Springer},
year = {2018},
url = {https://link.springer.com/content/pdf/bbm\%3A978-3-319-89929-9\%2F1.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/recomb/BassoHV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ChangHSV18,
author = {Minjun Chang and
Dorit S. Hochbaum and
Quico Spaen and
Mark Velednitsky},
editor = {Leah Epstein and
Thomas Erlebach},
title = {{DISPATCH:} An Optimally-Competitive Algorithm for Maximum Online
Perfect Bipartite Matching with i.i.d. Arrivals},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {149--164},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_10},
doi = {10.1007/978-3-030-04693-4\_10},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ChangHSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02014,
author = {Minjun Chang and
Dorit S. Hochbaum and
Quico Spaen and
Mark Velednitsky},
title = {{DISPATCH:} An Optimal Algorithm for Online Perfect Bipartite Matching
with i.i.d. Arrivals},
journal = {CoRR},
volume = {abs/1805.02014},
year = {2018},
url = {http://arxiv.org/abs/1805.02014},
eprinttype = {arXiv},
eprint = {1805.02014},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-04984,
author = {Dorit S. Hochbaum},
title = {Algorithms and Complexity of Range Clustering},
journal = {CoRR},
volume = {abs/1805.04984},
year = {2018},
url = {http://arxiv.org/abs/1805.04984},
eprinttype = {arXiv},
eprint = {1805.04984},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-04984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/HochbaumL17,
author = {Dorit S. Hochbaum and
Cheng Lu},
title = {A Faster Algorithm Solving a Generalization of Isotonic Median Regression
and a Class of Fused Lasso Problems},
journal = {{SIAM} J. Optim.},
volume = {27},
number = {4},
pages = {2563--2596},
year = {2017},
url = {https://doi.org/10.1137/15M1024081},
doi = {10.1137/15M1024081},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/HochbaumL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/BaumannHS17,
author = {Philipp Baumann and
Dorit S. Hochbaum and
Quico Spaen},
editor = {Jian{-}Yun Nie and
Zoran Obradovic and
Toyotaro Suzumura and
Rumi Ghosh and
Raghunath Nambiar and
Chonggang Wang and
Hui Zang and
Ricardo Baeza{-}Yates and
Xiaohua Hu and
Jeremy Kepner and
Alfredo Cuzzocrea and
Jian Tang and
Masashi Toyoda},
title = {High-performance geometric algorithms for sparse computation in big
data analytics},
booktitle = {2017 {IEEE} International Conference on Big Data {(IEEE} BigData 2017),
Boston, MA, USA, December 11-14, 2017},
pages = {546--555},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/BigData.2017.8257970},
doi = {10.1109/BIGDATA.2017.8257970},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bigdataconf/BaumannHS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/Hochbaum16,
author = {Dorit S. Hochbaum},
title = {A polynomial time repeated cuts algorithm for the time cost tradeoff
problem: The linear and convex crashing cost deadline problem},
journal = {Comput. Ind. Eng.},
volume = {95},
pages = {64--71},
year = {2016},
url = {https://doi.org/10.1016/j.cie.2016.02.018},
doi = {10.1016/J.CIE.2016.02.018},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candie/Hochbaum16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jrtip/FishbainHM16,
author = {Barak Fishbain and
Dorit S. Hochbaum and
Stefan M{\"{u}}ller},
title = {A competitive study of the pseudoflow algorithm for the minimum s-t
cut problem in vision applications},
journal = {J. Real Time Image Process.},
volume = {11},
number = {3},
pages = {589--609},
year = {2016},
url = {https://doi.org/10.1007/s11554-013-0344-3},
doi = {10.1007/S11554-013-0344-3},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jrtip/FishbainHM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tbd/HochbaumB16,
author = {Dorit S. Hochbaum and
Philipp Baumann},
title = {Sparse Computation for Large-Scale Data Mining},
journal = {{IEEE} Trans. Big Data},
volume = {2},
number = {2},
pages = {151--174},
year = {2016},
url = {https://doi.org/10.1109/TBDATA.2016.2576470},
doi = {10.1109/TBDATA.2016.2576470},
timestamp = {Thu, 27 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tbd/HochbaumB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpram/BaumannHS16,
author = {Philipp Baumann and
Dorit S. Hochbaum and
Quico Spaen},
editor = {Maria De Marsico and
Gabriella Sanniti di Baja and
Ana L. N. Fred},
title = {Sparse-Reduced Computation - Enabling Mining of Massively-large Data
Sets},
booktitle = {Proceedings of the 5th International Conference on Pattern Recognition
Applications and Methods, {ICPRAM} 2016, Rome, Italy, February 24-26,
2016},
pages = {224--231},
publisher = {SciTePress},
year = {2016},
url = {https://doi.org/10.5220/0005690402240231},
doi = {10.5220/0005690402240231},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icpram/BaumannHS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Hochbaum16,
author = {Dorit S. Hochbaum},
title = {Min cost flow on unit capacity networks and convex cost K-flow are
as easy as the assignment problem with All-Min-Cuts algorithm},
journal = {CoRR},
volume = {abs/1610.04012},
year = {2016},
url = {http://arxiv.org/abs/1610.04012},
eprinttype = {arXiv},
eprint = {1610.04012},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Hochbaum16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HochbaumW15,
author = {Dorit S. Hochbaum and
Michael R. Wagner},
title = {Range contracts: Risk sharing and beyond},
journal = {Eur. J. Oper. Res.},
volume = {243},
number = {3},
pages = {956--963},
year = {2015},
url = {https://doi.org/10.1016/j.ejor.2014.12.042},
doi = {10.1016/J.EJOR.2014.12.042},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/HochbaumW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ieem/BaumannCHPS15,
author = {Philipp Baumann and
Reynold J. Cooper and
Dorit S. Hochbaum and
Nidhi Patel and
Kunal Shalia},
title = {Efficient deployment of mobile detectors for security applications},
booktitle = {2015 {IEEE} International Conference on Industrial Engineering and
Engineering Management, {IEEM} 2015, Singapore, December 6-9, 2015},
pages = {214--218},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/IEEM.2015.7385639},
doi = {10.1109/IEEM.2015.7385639},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ieem/BaumannCHPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/YangFHNS14,
author = {Yan T. Yang and
Barak Fishbain and
Dorit S. Hochbaum and
Eric B. Norman and
Erik Swanberg},
title = {The Supervised Normalized Cut Method for Detecting, Classifying, and
Identifying Special Nuclear Materials},
journal = {{INFORMS} J. Comput.},
volume = {26},
number = {1},
pages = {45--58},
year = {2014},
url = {https://doi.org/10.1287/ijoc.1120.0546},
doi = {10.1287/IJOC.1120.0546},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/YangFHNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumLO14,
author = {Dorit S. Hochbaum and
Cheng Lyu and
Fernando Ord{\'{o}}{\~{n}}ez},
title = {Security routing games with multivehicle Chinese postman problem},
journal = {Networks},
volume = {64},
number = {3},
pages = {181--191},
year = {2014},
url = {https://doi.org/10.1002/net.21563},
doi = {10.1002/NET.21563},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/HochbaumLO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/HochbaumB14,
author = {Dorit S. Hochbaum and
Philipp Baumann},
editor = {Jimmy Lin and
Jian Pei and
Xiaohua Hu and
Wo Chang and
Raghunath Nambiar and
Charu C. Aggarwal and
Nick Cercone and
Vasant G. Honavar and
Jun Huan and
Bamshad Mobasher and
Saumyadipta Pyne},
title = {Sparse computation for large-scale data mining},
booktitle = {2014 {IEEE} International Conference on Big Data {(IEEE} BigData 2014),
Washington, DC, USA, October 27-30, 2014},
pages = {354--363},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/BigData.2014.7004252},
doi = {10.1109/BIGDATA.2014.7004252},
timestamp = {Fri, 19 Nov 2021 16:08:20 +0100},
biburl = {https://dblp.org/rec/conf/bigdataconf/HochbaumB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejco/HochbaumLB13,
author = {Dorit S. Hochbaum and
Cheng Lyu and
Erik Bertelli},
title = {Evaluating performance of image segmentation criteria and techniques},
journal = {{EURO} J. Comput. Optim.},
volume = {1},
number = {1-2},
pages = {155--180},
year = {2013},
url = {https://doi.org/10.1007/s13675-012-0002-8},
doi = {10.1007/S13675-012-0002-8},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejco/HochbaumLB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Hochbaum13,
author = {Dorit S. Hochbaum},
title = {A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables:
Replacing Spectral Techniques for Expander Ratio, Normalized Cut,
and Cheeger Constant},
journal = {Oper. Res.},
volume = {61},
number = {1},
pages = {184--198},
year = {2013},
url = {https://doi.org/10.1287/opre.1120.1126},
doi = {10.1287/OPRE.1120.1126},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Hochbaum13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumO13,
author = {Dorit S. Hochbaum and
James B. Orlin},
title = {Simplifications and speedups of the pseudoflow algorithm},
journal = {Networks},
volume = {61},
number = {1},
pages = {40--57},
year = {2013},
url = {https://doi.org/10.1002/net.21467},
doi = {10.1002/NET.21467},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HochbaumO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HochbaumL13,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {Approximation Algorithms for a Minimization Variant of the Order-Preserving
Submatrices and for Biclustering Problems},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {2},
pages = {19:1--19:12},
year = {2013},
url = {https://doi.org/10.1145/2438645.2438651},
doi = {10.1145/2438645.2438651},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/HochbaumL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rivp/FishbainHY13,
author = {Barak Fishbain and
Dorit S. Hochbaum and
Yan T. Yang},
editor = {Nasser Kehtarnavaz and
Matthias F. Carlsohn},
title = {Real-time robust target tracking in videos via graph-cuts},
booktitle = {Real-Time Image and Video Processing 2013, Burlingame, CA, USA, February
6-7, 2013},
series = {{SPIE} Proceedings},
volume = {8656},
pages = {865602},
publisher = {{SPIE}},
year = {2013},
url = {https://doi.org/10.1117/12.2002947},
doi = {10.1117/12.2002947},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/rivp/FishbainHY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/HochbaumHY12,
author = {Dorit S. Hochbaum and
Chun{-}Nan Hsu and
Yan T. Yang},
title = {Ranking of multidimensional drug profiling data by fractional-adjusted
bi-partitional scores},
journal = {Bioinform.},
volume = {28},
number = {12},
pages = {106--114},
year = {2012},
url = {https://doi.org/10.1093/bioinformatics/bts232},
doi = {10.1093/BIOINFORMATICS/BTS232},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/HochbaumHY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-6038,
author = {Marjan A. Baghaie and
Dorit S. Hochbaum and
Bhaskar Krishnamachari},
title = {Multiflow Transmission in Delay Constrained Cooperative Wireless Networks},
journal = {CoRR},
volume = {abs/1202.6038},
year = {2012},
url = {http://arxiv.org/abs/1202.6038},
eprinttype = {arXiv},
eprint = {1202.6038},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6038.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/HochbaumF11,
author = {Dorit S. Hochbaum and
Barak Fishbain},
title = {Nuclear threat detection with mobile distributed sensor networks},
journal = {Ann. Oper. Res.},
volume = {187},
number = {1},
pages = {45--63},
year = {2011},
url = {https://doi.org/10.1007/s10479-009-0643-z},
doi = {10.1007/S10479-009-0643-Z},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/HochbaumF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/QranfalHT11,
author = {Joe Qranfal and
Dorit S. Hochbaum and
Germain Tanoh},
title = {Experimental Analysis of the {MRF} Algorithm for Segmentation of Noisy
Medical Images},
journal = {Algorithmic Oper. Res.},
volume = {6},
number = {2},
pages = {79--90},
year = {2011},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/18234},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/QranfalHT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HochbaumMYC11,
author = {Dorit S. Hochbaum and
Erick Moreno{-}Centeno and
Phillip Yelland and
Rodolfo A. Catena},
title = {Rating Customers According to Their Promptness to Adopt New Products},
journal = {Oper. Res.},
volume = {59},
number = {5},
pages = {1171--1183},
year = {2011},
url = {https://doi.org/10.1287/opre.1110.0963},
doi = {10.1287/OPRE.1110.0963},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HochbaumMYC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/BaghaieHK11,
author = {Marjan A. Baghaie and
Dorit S. Hochbaum and
Bhaskar Krishnamachari},
title = {On Hardness of Multiflow Transmission in Delay Constrained Cooperative
Wireless Networks},
booktitle = {Proceedings of the Global Communications Conference, {GLOBECOM} 2011,
5-9 December 2011, Houston, Texas, {USA}},
pages = {1--5},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/GLOCOM.2011.6134487},
doi = {10.1109/GLOCOM.2011.6134487},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/globecom/BaghaieHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scalespace/Hochbaum11,
author = {Dorit S. Hochbaum},
editor = {Alfred M. Bruckstein and
Bart M. ter Haar Romeny and
Alexander M. Bronstein and
Michael M. Bronstein},
title = {An Efficient and Effective Tool for Image Segmentation, Total Variations
and Regularization},
booktitle = {Scale Space and Variational Methods in Computer Vision - Third International
Conference, {SSVM} 2011, Ein-Gedi, Israel, May 29 - June 2, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6667},
pages = {338--349},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24785-9\_29},
doi = {10.1007/978-3-642-24785-9\_29},
timestamp = {Mon, 26 Jun 2023 20:44:34 +0200},
biburl = {https://dblp.org/rec/conf/scalespace/Hochbaum11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-3499,
author = {Ilan Adler and
Dorit S. Hochbaum},
title = {Benchmark Problems for Totally Unimodular Set System Auction},
journal = {CoRR},
volume = {abs/1102.3499},
year = {2011},
url = {http://arxiv.org/abs/1102.3499},
eprinttype = {arXiv},
eprint = {1102.3499},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-3499.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-1569,
author = {Bala G. Chandran and
Dorit S. Hochbaum},
title = {Practical and theoretical improvements for bipartite matching using
the pseudoflow algorithm},
journal = {CoRR},
volume = {abs/1105.1569},
year = {2011},
url = {http://arxiv.org/abs/1105.1569},
eprinttype = {arXiv},
eprint = {1105.1569},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-1569.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/HochbaumL10,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {How to allocate review tasks for robust ranking},
journal = {Acta Informatica},
volume = {47},
number = {5-6},
pages = {325--345},
year = {2010},
url = {https://doi.org/10.1007/s00236-010-0120-9},
doi = {10.1007/S00236-010-0120-9},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/HochbaumL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CuiH10,
author = {Tingting Cui and
Dorit S. Hochbaum},
title = {Complexity of some inverse shortest path lengths problems},
journal = {Networks},
volume = {56},
number = {1},
pages = {20--29},
year = {2010},
url = {https://doi.org/10.1002/net.20344},
doi = {10.1002/NET.20344},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CuiH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pami/Hochbaum10,
author = {Dorit S. Hochbaum},
title = {Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized
Cut},
journal = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
volume = {32},
number = {5},
pages = {889--898},
year = {2010},
url = {https://doi.org/10.1109/TPAMI.2009.80},
doi = {10.1109/TPAMI.2009.80},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pami/Hochbaum10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HochbaumL10,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {Covering the edges of bipartite graphs using K\({}_{\mbox{2, 2}}\)
graphs},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {1},
pages = {1--9},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.08.018},
doi = {10.1016/J.TCS.2009.08.018},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HochbaumL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-4531,
author = {Barak Fishbain and
Dorit S. Hochbaum and
Stefan M{\"{u}}ller},
title = {Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision
Problems},
journal = {CoRR},
volume = {abs/1007.4531},
year = {2010},
url = {http://arxiv.org/abs/1007.4531},
eprinttype = {arXiv},
eprint = {1007.4531},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-4531.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-1945,
author = {Dorit S. Hochbaum},
title = {Submodular problems - approximations and algorithms},
journal = {CoRR},
volume = {abs/1010.1945},
year = {2010},
url = {http://arxiv.org/abs/1010.1945},
eprinttype = {arXiv},
eprint = {1010.1945},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-1945.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Hochbaum09,
author = {Dorit S. Hochbaum},
title = {Dynamic evolution of economically preferred facilities},
journal = {Eur. J. Oper. Res.},
volume = {193},
number = {3},
pages = {649--659},
year = {2009},
url = {https://doi.org/10.1016/j.ejor.2007.07.027},
doi = {10.1016/J.EJOR.2007.07.027},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Hochbaum09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/ChandranH09,
author = {Bala G. Chandran and
Dorit S. Hochbaum},
title = {A Computational Study of the Pseudoflow and Push-Relabel Algorithms
for the Maximum Flow Problem},
journal = {Oper. Res.},
volume = {57},
number = {2},
pages = {358--376},
year = {2009},
url = {https://doi.org/10.1287/opre.1080.0572},
doi = {10.1287/OPRE.1080.0572},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/ChandranH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumL09,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {The multi-integer set cover and the facility terminal cover problem},
journal = {Networks},
volume = {53},
number = {1},
pages = {63--66},
year = {2009},
url = {https://doi.org/10.1002/net.20265},
doi = {10.1002/NET.20265},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HochbaumL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/biostec/Hochbaum09,
author = {Dorit S. Hochbaum},
editor = {Pedro Encarna{\c{c}}{\~{a}}o and
Ant{\'{o}}nio P. Veloso},
title = {An Efficient and Effective Image Segmentation Interactive Tool},
booktitle = {{BIOSIGNALS} 2009 - Proceedings of the International Conference on
Bio-inspired Systems and Signal Processing, Porto, Portugal, January
14-17, 2009},
pages = {459--461},
publisher = {{INSTICC} Press},
year = {2009},
timestamp = {Mon, 29 Aug 2022 17:06:59 +0200},
biburl = {https://dblp.org/rec/conf/biostec/Hochbaum09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccv/HochbaumS09,
author = {Dorit S. Hochbaum and
Vikas Singh},
title = {An efficient algorithm for Co-segmentation},
booktitle = {{IEEE} 12th International Conference on Computer Vision, {ICCV} 2009,
Kyoto, Japan, September 27 - October 4, 2009},
pages = {269--276},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/ICCV.2009.5459261},
doi = {10.1109/ICCV.2009.5459261},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iccv/HochbaumS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AhujaH08,
author = {Ravindra K. Ahuja and
Dorit S. Hochbaum},
title = {Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in
\emph{O}(\emph{n} log \emph{n}) Time},
journal = {Oper. Res.},
volume = {56},
number = {1},
pages = {255--261},
year = {2008},
url = {https://doi.org/10.1287/opre.1070.0508},
doi = {10.1287/OPRE.1070.0508},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AhujaH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Hochbaum08,
author = {Dorit S. Hochbaum},
title = {The Pseudoflow Algorithm: {A} New Algorithm for the Maximum-Flow Problem},
journal = {Oper. Res.},
volume = {56},
number = {4},
pages = {992--1009},
year = {2008},
url = {https://doi.org/10.1287/opre.1080.0524},
doi = {10.1287/OPRE.1080.0524},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Hochbaum08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/HochbaumM08,
author = {Dorit S. Hochbaum and
Erick Moreno{-}Centeno},
title = {Country credit-risk rating aggregation via the separation-deviation
model},
journal = {Optim. Methods Softw.},
volume = {23},
number = {5},
pages = {741--762},
year = {2008},
url = {https://doi.org/10.1080/10556780802402432},
doi = {10.1080/10556780802402432},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/HochbaumM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HochbaumM08,
author = {Dorit S. Hochbaum and
Erick Moreno{-}Centeno},
title = {The inequality-satisfiability problem},
journal = {Oper. Res. Lett.},
volume = {36},
number = {2},
pages = {229--233},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.05.005},
doi = {10.1016/J.ORL.2007.05.005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HochbaumM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0803-0146,
author = {Dorit S. Hochbaum},
title = {Polynomial time algorithms for bi-criteria, multi-objective and ratio
problems in clustering and imaging. Part {I:} Normalized cut and ratio
regions},
journal = {CoRR},
volume = {abs/0803.0146},
year = {2008},
url = {http://arxiv.org/abs/0803.0146},
eprinttype = {arXiv},
eprint = {0803.0146},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0803-0146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Hochbaum07,
author = {Dorit S. Hochbaum},
title = {Complexity and algorithms for nonlinear optimization problems},
journal = {Ann. Oper. Res.},
volume = {153},
number = {1},
pages = {257--296},
year = {2007},
url = {https://doi.org/10.1007/s10479-007-0172-6},
doi = {10.1007/S10479-007-0172-6},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Hochbaum07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HochbaumL07,
author = {Dorit S. Hochbaum and
Asaf Levin},
editor = {Christos Kaklamanis and
Martin Skutella},
title = {Covering the Edges of Bipartite Graphs Using \emph{K} \({}_{\mbox{2,
2}}\) Graphs},
booktitle = {Approximation and Online Algorithms, 5th International Workshop, {WAOA}
2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4927},
pages = {116--127},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77918-6\_10},
doi = {10.1007/978-3-540-77918-6\_10},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HochbaumL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/HochbaumL06,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {Cyclical scheduling and multi-shift scheduling: Complexity and approximation
algorithms},
journal = {Discret. Optim.},
volume = {3},
number = {4},
pages = {327--340},
year = {2006},
url = {https://doi.org/10.1016/j.disopt.2006.02.002},
doi = {10.1016/J.DISOPT.2006.02.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/HochbaumL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/HochbaumL06,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {Methodologies and Algorithms for Group-Rankings Decision},
journal = {Manag. Sci.},
volume = {52},
number = {9},
pages = {1394--1408},
year = {2006},
url = {https://doi.org/10.1287/mnsc.1060.0540},
doi = {10.1287/MNSC.1060.0540},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/HochbaumL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/HochbaumL06,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {Optimizing over Consecutive 1's and Circular 1's Constraints},
journal = {{SIAM} J. Optim.},
volume = {17},
number = {2},
pages = {311--330},
year = {2006},
url = {https://doi.org/10.1137/040603048},
doi = {10.1137/040603048},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/HochbaumL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HochbaumL06,
author = {Dorit S. Hochbaum and
Asaf Levin},
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {The \emph{k}-Allocation Problem and Its Variants},
booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
pages = {253--264},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125\_20},
doi = {10.1007/11970125\_20},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HochbaumL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/Hochbaum06,
author = {Dorit S. Hochbaum},
editor = {Paul G. Spirakis and
Marios Mavronicolas and
Spyros C. Kontogiannis},
title = {Ranking Sports Teams and the Inverse Equal Paths Problem},
booktitle = {Internet and Network Economics, Second International Workshop, {WINE}
2006, Patras, Greece, December 15-17, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4286},
pages = {307--318},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944874\_28},
doi = {10.1007/11944874\_28},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/Hochbaum06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/Hochbaum05,
author = {Dorit S. Hochbaum},
title = {Complexity and algorithms for convex network optimization and other
nonlinear problems},
journal = {4OR},
volume = {3},
number = {3},
pages = {171--216},
year = {2005},
url = {https://doi.org/10.1007/s10288-005-0078-6},
doi = {10.1007/S10288-005-0078-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/Hochbaum05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AhujaHO04,
author = {Ravindra K. Ahuja and
Dorit S. Hochbaum and
James B. Orlin},
title = {A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network
Flow Problem},
journal = {Algorithmica},
volume = {39},
number = {3},
pages = {189--208},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1085-2},
doi = {10.1007/S00453-004-1085-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AhujaHO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/Hochbaum04,
author = {Dorit S. Hochbaum},
title = {50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs,
Maximum Closure, and Implications on Algorithmic Methods Today},
journal = {Manag. Sci.},
volume = {50},
number = {6},
pages = {709--723},
year = {2004},
url = {https://doi.org/10.1287/mnsc.1040.0242},
doi = {10.1287/MNSC.1040.0242},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/Hochbaum04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Hochbaum04,
author = {Dorit S. Hochbaum},
title = {Monotonizing linear programs with up to two nonzeroes per column},
journal = {Oper. Res. Lett.},
volume = {32},
number = {1},
pages = {49--58},
year = {2004},
url = {https://doi.org/10.1016/S0167-6377(03)00074-9},
doi = {10.1016/S0167-6377(03)00074-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Hochbaum04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/KaminskyH04,
author = {Philip M. Kaminsky and
Dorit S. Hochbaum},
editor = {Joseph Y.{-}T. Leung},
title = {Due Date Quotation Models and Algorithms},
booktitle = {Handbook of Scheduling - Algorithms, Models, and Performance Analysis},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {http://www.crcnetbase.com/doi/abs/10.1201/9780203489802.ch20},
doi = {10.1201/9780203489802.CH20},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/KaminskyH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Hochbaum03,
author = {Dorit S. Hochbaum},
title = {Efficient Algorithms for the Inverse Spanning-Tree Problem},
journal = {Oper. Res.},
volume = {51},
number = {5},
pages = {785--797},
year = {2003},
url = {https://doi.org/10.1287/opre.51.5.785.16756},
doi = {10.1287/OPRE.51.5.785.16756},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Hochbaum03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/AhujaHO03,
author = {Ravindra K. Ahuja and
Dorit S. Hochbaum and
James B. Orlin},
title = {Solving the Convex Cost Integer Dual Network Flow Problem},
journal = {Manag. Sci.},
volume = {49},
number = {7},
pages = {950--964},
year = {2003},
url = {https://doi.org/10.1287/mnsc.49.7.950.16384},
doi = {10.1287/MNSC.49.7.950.16384},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/AhujaHO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldschmidtHLO03,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum and
Asaf Levin and
Eli V. Olinick},
title = {The {SONET} edge-partition problem},
journal = {Networks},
volume = {41},
number = {1},
pages = {13--23},
year = {2003},
url = {https://doi.org/10.1002/net.10054},
doi = {10.1002/NET.10054},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldschmidtHLO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HochbaumQ03,
author = {Dorit S. Hochbaum and
Maurice Queyranne},
title = {Minimizing a Convex Cost Closure Set},
journal = {{SIAM} J. Discret. Math.},
volume = {16},
number = {2},
pages = {192--207},
year = {2003},
url = {https://doi.org/10.1137/S0895480100369584},
doi = {10.1137/S0895480100369584},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HochbaumQ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Hochbaum02,
author = {Dorit S. Hochbaum},
title = {Solving integer programs over monotone inequalities in three variables:
{A} framework for half integrality and good approximations},
journal = {Eur. J. Oper. Res.},
volume = {140},
number = {2},
pages = {291--321},
year = {2002},
url = {https://doi.org/10.1016/S0377-2217(02)00071-1},
doi = {10.1016/S0377-2217(02)00071-1},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Hochbaum02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/interfaces/AdlerEHO02,
author = {Ilan Adler and
Alan L. Erera and
Dorit S. Hochbaum and
Eli V. Olinick},
title = {Baseball, Optimization, and the World Wide Web},
journal = {Interfaces},
volume = {32},
number = {2},
pages = {12--22},
year = {2002},
url = {https://doi.org/10.1287/inte.32.2.12.67},
doi = {10.1287/INTE.32.2.12.67},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/interfaces/AdlerEHO02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumT02,
author = {Dorit S. Hochbaum and
Paul A. Tucker},
title = {Minimax problems with bitonic matrices},
journal = {Networks},
volume = {40},
number = {3},
pages = {113--124},
year = {2002},
url = {https://doi.org/10.1002/net.10038},
doi = {10.1002/NET.10038},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HochbaumT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/HochbaumO01,
author = {Dorit S. Hochbaum and
Eli V. Olinick},
title = {The Bounded Cycle-Cover Problem},
journal = {{INFORMS} J. Comput.},
volume = {13},
number = {2},
pages = {104--119},
year = {2001},
url = {https://doi.org/10.1287/ijoc.13.2.104.10516},
doi = {10.1287/IJOC.13.2.104.10516},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/HochbaumO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hochbaum01,
author = {Dorit S. Hochbaum},
title = {An efficient algorithm for image segmentation, Markov random fields
and related problems},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {686--701},
year = {2001},
url = {https://doi.org/10.1145/502090.502093},
doi = {10.1145/502090.502093},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hochbaum01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/AtamturkH01,
author = {Alper Atamt{\"{u}}rk and
Dorit S. Hochbaum},
title = {Capacity Acquisition, Subcontracting, and Lot Sizing},
journal = {Manag. Sci.},
volume = {47},
number = {8},
pages = {1081--1100},
year = {2001},
url = {https://doi.org/10.1287/mnsc.47.8.1081.10232},
doi = {10.1287/MNSC.47.8.1081.10232},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/AtamturkH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hochbaum01,
author = {Dorit S. Hochbaum},
title = {A new - old algorithm for minimum-cut and maximum-flow in closure
graphs},
journal = {Networks},
volume = {37},
number = {4},
pages = {171--193},
year = {2001},
url = {https://doi.org/10.1002/net.1012},
doi = {10.1002/NET.1012},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hochbaum01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HochbaumP00,
author = {Dorit S. Hochbaum and
Anu Pathria},
title = {Approximating a generalization of {MAX} 2SAT and {MIN} 2SAT},
journal = {Discret. Appl. Math.},
volume = {107},
number = {1-3},
pages = {41--59},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(00)00244-4},
doi = {10.1016/S0166-218X(00)00244-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HochbaumP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HochbaumC00,
author = {Dorit S. Hochbaum and
Anna Chen},
title = {Performance Analysis and Best Implementations of Old and New Algorithms
for the Open-Pit Mining Problem},
journal = {Oper. Res.},
volume = {48},
number = {6},
pages = {894--914},
year = {2000},
url = {https://doi.org/10.1287/opre.48.6.894.12392},
doi = {10.1287/OPRE.48.6.894.12392},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HochbaumC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Hochbaum00,
author = {Dorit S. Hochbaum},
editor = {Klaus Jansen and
Samir Khuller},
title = {Instant recognition of polynominal time solvability, half integrality
and 2-approximations},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {2--14},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_2},
doi = {10.1007/3-540-44436-X\_2},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Hochbaum00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HochbaumQ00,
author = {Dorit S. Hochbaum and
Maurice Queyranne},
editor = {Mike Paterson},
title = {Minimizing a Convex Cost Closure Set},
booktitle = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1879},
pages = {256--267},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45253-2\_24},
doi = {10.1007/3-540-45253-2\_24},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HochbaumQ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HochbaumW99,
author = {Dorit S. Hochbaum and
Gerhard J. Woeginger},
title = {A linear-time algorithm for the bottleneck transportation problem
with a fixed number of sources},
journal = {Oper. Res. Lett.},
volume = {24},
number = {1-2},
pages = {25--28},
year = {1999},
url = {https://doi.org/10.1016/S0167-6377(98)00053-4},
doi = {10.1016/S0167-6377(98)00053-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HochbaumW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChudakH99,
author = {Fabi{\'{a}}n A. Chudak and
Dorit S. Hochbaum},
title = {A half-integral linear programming relaxation for scheduling precedence-constrained
jobs on a single machine},
journal = {Oper. Res. Lett.},
volume = {25},
number = {5},
pages = {199--204},
year = {1999},
url = {https://doi.org/10.1016/S0167-6377(99)00056-5},
doi = {10.1016/S0167-6377(99)00056-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChudakH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AhujaHO99,
author = {Ravindra K. Ahuja and
Dorit S. Hochbaum and
James B. Orlin},
editor = {G{\'{e}}rard Cornu{\'{e}}jols and
Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Solving the Convex Cost Integer Dual Network Flow Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 7th International
{IPCO} Conference, Graz, Austria, June 9-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1610},
pages = {31--44},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48777-8\_3},
doi = {10.1007/3-540-48777-8\_3},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AhujaHO99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/random/1999,
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/b72324},
doi = {10.1007/B72324},
isbn = {3-540-66329-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/1999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Hochbaum98,
author = {Dorit S. Hochbaum},
title = {Approximating Clique and Biclique Problems},
journal = {J. Algorithms},
volume = {29},
number = {1},
pages = {174--200},
year = {1998},
url = {https://doi.org/10.1006/jagm.1998.0964},
doi = {10.1006/JAGM.1998.0964},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Hochbaum98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChudakGHW98,
author = {Fabi{\'{a}}n A. Chudak and
Michel X. Goemans and
Dorit S. Hochbaum and
David P. Williamson},
title = {A primal-dual interpretation of two 2-approximation algorithms for
the feedback vertex set problem in undirected graphs},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {111--118},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00021-2},
doi = {10.1016/S0167-6377(98)00021-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChudakGHW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Hochbaum98,
author = {Dorit S. Hochbaum},
editor = {Klaus Jansen and
Dorit S. Hochbaum},
title = {Instant Recognition of Half Integrality and 2-Approximations},
booktitle = {Approximation Algorithms for Combinatorial Optimization, International
Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1444},
pages = {99--110},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0053967},
doi = {10.1007/BFB0053967},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/approx/Hochbaum98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Hochbaum98a,
author = {Dorit S. Hochbaum},
editor = {Klaus Jansen and
Dorit S. Hochbaum},
title = {The \emph{t}-Vertex Cover Problem: Extending the Half Integrality
Framework with Budget Constraints},
booktitle = {Approximation Algorithms for Combinatorial Optimization, International
Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1444},
pages = {111--122},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0053968},
doi = {10.1007/BFB0053968},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Hochbaum98a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Hochbaum98,
author = {Dorit S. Hochbaum},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the
Maximum Flow Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {325--337},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_25},
doi = {10.1007/3-540-69346-7\_25},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Hochbaum98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/1998,
editor = {Klaus Jansen and
Dorit S. Hochbaum},
title = {Approximation Algorithms for Combinatorial Optimization, International
Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1444},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0053958},
doi = {10.1007/BFB0053958},
isbn = {3-540-64736-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/1998.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GargH97,
author = {Naveen Garg and
Dorit S. Hochbaum},
title = {An {O} (log k)-Approximation Algorithm for the k Minimum Spanning
Tree Problem in the Plane},
journal = {Algorithmica},
volume = {18},
number = {1},
pages = {111--121},
year = {1997},
url = {https://doi.org/10.1007/BF02523691},
doi = {10.1007/BF02523691},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GargH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HochbaumL97,
author = {Dorit S. Hochbaum and
Dan Landy},
title = {Scheduling with Batching: Two Job Types},
journal = {Discret. Appl. Math.},
volume = {72},
number = {1-2},
pages = {99--114},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00039-X},
doi = {10.1016/S0166-218X(96)00039-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HochbaumL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GoldschmidtH97,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum},
title = {k-edge Subgraph Problems},
journal = {Discret. Appl. Math.},
volume = {74},
number = {2},
pages = {159--169},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00030-3},
doi = {10.1016/S0166-218X(96)00030-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GoldschmidtH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HochbaumP97,
author = {Dorit S. Hochbaum and
Anu Pathria},
title = {Generalized p-Center problems: Complexity results and approximation
algorithms},
journal = {Eur. J. Oper. Res.},
volume = {100},
number = {3},
pages = {594--607},
year = {1997},
url = {https://doi.org/10.1016/S0377-2217(96)00076-8},
doi = {10.1016/S0377-2217(96)00076-8},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/HochbaumP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AdamsH97,
author = {J. B. Adams and
Dorit S. Hochbaum},
title = {A New and Fast Approach to Very Large Scale Integrated Sequential
Circuit Test Generation},
journal = {Oper. Res.},
volume = {45},
number = {6},
pages = {842--856},
year = {1997},
url = {https://doi.org/10.1287/opre.45.6.842},
doi = {10.1287/OPRE.45.6.842},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AdamsH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HochbaumL97,
author = {Dorit S. Hochbaum and
Dan Landy},
title = {Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime},
journal = {Oper. Res.},
volume = {45},
number = {6},
pages = {874--885},
year = {1997},
url = {https://doi.org/10.1287/opre.45.6.874},
doi = {10.1287/OPRE.45.6.874},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HochbaumL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/HochbaumP97,
author = {Dorit S. Hochbaum and
Anu Pathria},
title = {Path Costs in Evolutionary Tree Reconstruction},
journal = {J. Comput. Biol.},
volume = {4},
number = {2},
pages = {163--175},
year = {1997},
url = {https://doi.org/10.1089/cmb.1997.4.163},
doi = {10.1089/CMB.1997.4.163},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/HochbaumP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Hochba97,
author = {Dorit S. Hochbaum},
title = {Approximation Algorithms for NP-Hard Problems},
journal = {{SIGACT} News},
volume = {28},
number = {2},
pages = {40--52},
year = {1997},
url = {https://doi.org/10.1145/261342.571216},
doi = {10.1145/261342.571216},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Hochba97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HochbaumN96,
author = {Dorit S. Hochbaum and
Joseph Naor},
title = {Approximation Algorithms for Network Design Problems on Bounded Subsets},
journal = {J. Algorithms},
volume = {21},
number = {2},
pages = {403--414},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0050},
doi = {10.1006/JAGM.1996.0050},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HochbaumN96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumP96,
author = {Dorit S. Hochbaum and
Anu Pathria},
title = {The bottleneck graph partition problem},
journal = {Networks},
volume = {28},
number = {4},
pages = {221--225},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0037(199612)28:4\&\#60;221::AID-NET6\&\#62;3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0037(199612)28:4\&\#60;221::AID-NET6\&\#62;3.0.CO;2-N},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HochbaumP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoldschmidtHHY96,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum and
Cor A. J. Hurkens and
Gang Yu},
title = {Approximation Algorithms for the \emph{k}-Clique Covering Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {9},
number = {3},
pages = {492--509},
year = {1996},
url = {https://doi.org/10.1137/S089548019325232X},
doi = {10.1137/S089548019325232X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GoldschmidtHHY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/HochbaumH96,
author = {Dorit S. Hochbaum and
Sung{-}Pil Hong},
title = {On the Complexity of the Production-Transportation Problem},
journal = {{SIAM} J. Optim.},
volume = {6},
number = {1},
pages = {250--264},
year = {1996},
url = {https://doi.org/10.1137/0806014},
doi = {10.1137/0806014},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/HochbaumH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/Hochbaum96,
author = {Dorit S. Hochbaum},
title = {An optimal test compression procedure for combinational circuits},
journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
volume = {15},
number = {10},
pages = {1294--1299},
year = {1996},
url = {https://doi.org/10.1109/43.541449},
doi = {10.1109/43.541449},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcad/Hochbaum96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HochbaumH95,
author = {Dorit S. Hochbaum and
Sung{-}Pil Hong},
title = {About strongly polynomial time algorithms for quadratic optimization
over submodular constraints},
journal = {Math. Program.},
volume = {69},
pages = {269--309},
year = {1995},
url = {https://doi.org/10.1007/BF01585561},
doi = {10.1007/BF01585561},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HochbaumH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Hochbaum95,
author = {Dorit S. Hochbaum},
title = {A nonlinear Knapsack problem},
journal = {Oper. Res. Lett.},
volume = {17},
number = {3},
pages = {103--110},
year = {1995},
url = {https://doi.org/10.1016/0167-6377(95)00009-9},
doi = {10.1016/0167-6377(95)00009-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Hochbaum95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/GoldschmidtH94,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum},
title = {A Polynomial Algorithm for the k-cut Problem for Fixed k},
journal = {Math. Oper. Res.},
volume = {19},
number = {1},
pages = {24--37},
year = {1994},
url = {https://doi.org/10.1287/moor.19.1.24},
doi = {10.1287/MOOR.19.1.24},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/GoldschmidtH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/CosaresH94,
author = {Steven Cosares and
Dorit S. Hochbaum},
title = {Strongly Polynomial Algorithms for the Quadratic Transportation Problem
with a Fixed Number of Sources},
journal = {Math. Oper. Res.},
volume = {19},
number = {1},
pages = {94--111},
year = {1994},
url = {https://doi.org/10.1287/moor.19.1.94},
doi = {10.1287/MOOR.19.1.94},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/CosaresH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Hochbaum94,
author = {Dorit S. Hochbaum},
title = {Lower and Upper Bounds for the Allocation Problem and Other Nonlinear
Optimization Problems},
journal = {Math. Oper. Res.},
volume = {19},
number = {2},
pages = {390--409},
year = {1994},
url = {https://doi.org/10.1287/moor.19.2.390},
doi = {10.1287/MOOR.19.2.390},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Hochbaum94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HochbaumL94,
author = {Dorit S. Hochbaum and
Dan Landy},
title = {Scheduling with batching: minimizing the weighted number of tardy
jobs},
journal = {Oper. Res. Lett.},
volume = {16},
number = {2},
pages = {79--86},
year = {1994},
url = {https://doi.org/10.1016/0167-6377(94)90063-9},
doi = {10.1016/0167-6377(94)90063-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HochbaumL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HochbaumN94,
author = {Dorit S. Hochbaum and
Joseph Naor},
title = {Simple and Fast Algorithms for Linear and Integer Programs With Two
Variables per Inequality},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {6},
pages = {1179--1192},
year = {1994},
url = {https://doi.org/10.1137/S0097539793251876},
doi = {10.1137/S0097539793251876},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HochbaumN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargH94,
author = {Naveen Garg and
Dorit S. Hochbaum},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {An O(log k) approximation algorithm for the k minimum spanning tree
problem in the plane},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {432--438},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195218},
doi = {10.1145/195058.195218},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GargH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/HochbaumS93,
author = {Dorit S. Hochbaum and
Sridhar Seshadri},
title = {The empirical performance of a polynomial algorithm for constrained
nonlinear optimization},
journal = {Ann. Oper. Res.},
volume = {43},
number = {4},
pages = {229--248},
year = {1993},
url = {https://doi.org/10.1007/BF02025453},
doi = {10.1007/BF02025453},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/HochbaumS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hochbaum93,
author = {Dorit S. Hochbaum},
title = {Why Should Biconnected Components be Identified First},
journal = {Discret. Appl. Math.},
volume = {42},
number = {2},
pages = {203--210},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90046-Q},
doi = {10.1016/0166-218X(93)90046-Q},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hochbaum93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldschmidtHY93,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum and
Gang Yu},
title = {A Modified Greedy Heuristic for the Set Covering Problem with Improved
Worst Case Bound},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {305--310},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90173-7},
doi = {10.1016/0020-0190(93)90173-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoldschmidtHY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HochbaumMNT93,
author = {Dorit S. Hochbaum and
Nimrod Megiddo and
Joseph Naor and
Arie Tamir},
title = {Tight bounds and 2-approximation algorithms for integer programs with
two variables per inequality},
journal = {Math. Program.},
volume = {62},
pages = {69--83},
year = {1993},
url = {https://doi.org/10.1007/BF01585160},
doi = {10.1007/BF01585160},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HochbaumMNT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Hochbaum92,
author = {Dorit S. Hochbaum},
title = {An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths
and Communication Problems on Random Graphs},
journal = {Oper. Res.},
volume = {40},
number = {5},
pages = {923--935},
year = {1992},
url = {https://doi.org/10.1287/opre.40.5.923},
doi = {10.1287/OPRE.40.5.923},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Hochbaum92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HochbaumSS92,
author = {Dorit S. Hochbaum and
Ron Shamir and
J. George Shanthikumar},
title = {A polynomial algorithm for an integer quadratic non-separable transportation
problem},
journal = {Math. Program.},
volume = {55},
pages = {359--371},
year = {1992},
url = {https://doi.org/10.1007/BF01581207},
doi = {10.1007/BF01581207},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/HochbaumSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HochbaumN92,
author = {Dorit S. Hochbaum and
Joseph Naor},
editor = {Egon Balas and
G{\'{e}}rard Cornu{\'{e}}jols and
Ravi Kannan},
title = {Simple and Fast Algorithms for Linear and Integer Programs with Two
Variables Per Inequality},
booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
Conference, Pittsburgh, PA, USA, May 1992},
pages = {44--59},
publisher = {Carnegie Mellon University},
year = {1992},
timestamp = {Thu, 21 Jun 2018 07:38:51 +0200},
biburl = {https://dblp.org/rec/conf/ipco/HochbaumN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HochbaumS91,
author = {Dorit S. Hochbaum and
Ron Shamir},
title = {Strongly Polynomial Algorithms for the High Multiplicity Scheduling
Problem},
journal = {Oper. Res.},
volume = {39},
number = {4},
pages = {648--653},
year = {1991},
url = {https://doi.org/10.1287/opre.39.4.648},
doi = {10.1287/OPRE.39.4.648},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HochbaumS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HochbaumS90,
author = {Dorit S. Hochbaum and
Ron Shamir},
title = {Minimizing the number of tardy job units under release time constraints},
journal = {Discret. Appl. Math.},
volume = {28},
number = {1},
pages = {45--57},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90093-R},
doi = {10.1016/0166-218X(90)90093-R},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HochbaumS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HochbaumS90,
author = {Dorit S. Hochbaum and
J. George Shanthikumar},
title = {Convex Separable Optimization Is Not Much Harder than Linear Optimization},
journal = {J. {ACM}},
volume = {37},
number = {4},
pages = {843--862},
year = {1990},
url = {https://doi.org/10.1145/96559.96597},
doi = {10.1145/96559.96597},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HochbaumS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoldschmidtH90,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum},
title = {A Fast Perfect-Matching Algorithm in Random Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {3},
number = {1},
pages = {48--57},
year = {1990},
url = {https://doi.org/10.1137/0403006},
doi = {10.1137/0403006},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GoldschmidtH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoldschmidtH90a,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum},
title = {Asymptotically Optimal Linear Algorithm for the Minimum \emph{k}-Cut
in a Random Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {3},
number = {1},
pages = {58--73},
year = {1990},
url = {https://doi.org/10.1137/0403007},
doi = {10.1137/0403007},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GoldschmidtH90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Hochbaum90,
author = {Dorit S. Hochbaum},
editor = {Ravi Kannan and
William R. Pulleyblank},
title = {On the Impossibility of Strongly Polynomial Algorithms for the Allocation
Problem and its Extensions},
booktitle = {Proceedings of the 1st Integer Programming and Combinatorial Optimization
Conference, Waterloo, Ontorio, Canada, May 28-30 1990},
pages = {261--273},
publisher = {University of Waterloo Press},
year = {1990},
timestamp = {Wed, 09 Oct 2002 12:35:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Hochbaum90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HochbaumS89,
author = {Dorit S. Hochbaum and
Ron Shamir},
title = {An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {215--219},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90126-9},
doi = {10.1016/0020-0190(89)90126-9},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HochbaumS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumS89,
author = {Dorit S. Hochbaum and
Arie Segev},
title = {Analysis of a flow problem with fixed charges},
journal = {Networks},
volume = {19},
number = {3},
pages = {291--312},
year = {1989},
url = {https://doi.org/10.1002/net.3230190304},
doi = {10.1002/NET.3230190304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HochbaumS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HochbaumS89,
author = {Dorit S. Hochbaum and
J. George Shanthikumar},
editor = {Giorgio Ausiello and
Mariangiola Dezani{-}Ciancaglini and
Simona Ronchi Della Rocca},
title = {The Complexity of Nonlinear Separable Optimization},
booktitle = {Automata, Languages and Programming, 16th International Colloquium,
ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {372},
pages = {461--472},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0035777},
doi = {10.1007/BFB0035777},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HochbaumS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HochbaumS88,
author = {Dorit S. Hochbaum and
David B. Shmoys},
title = {A Polynomial Approximation Scheme for Scheduling on Uniform Processors:
Using the Dual Approximation Approach},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {3},
pages = {539--551},
year = {1988},
url = {https://doi.org/10.1137/0217033},
doi = {10.1137/0217033},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HochbaumS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldschmidtH88,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum},
title = {Polynomial Algorithm for the k-Cut Problem},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {444--451},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21960},
doi = {10.1109/SFCS.1988.21960},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoldschmidtH88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HochbaumS87,
author = {Dorit S. Hochbaum and
David B. Shmoys},
title = {Using dual approximation algorithms for scheduling problems theoretical
and practical results},
journal = {J. {ACM}},
volume = {34},
number = {1},
pages = {144--162},
year = {1987},
url = {https://doi.org/10.1145/7531.7535},
doi = {10.1145/7531.7535},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HochbaumS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HochbaumM87,
author = {Dorit S. Hochbaum and
Wolfgang Maass},
title = {Fast Approximation Algorithms for a Nonconvex Covering Problem},
journal = {J. Algorithms},
volume = {8},
number = {3},
pages = {305--323},
year = {1987},
url = {https://doi.org/10.1016/0196-6774(87)90012-5},
doi = {10.1016/0196-6774(87)90012-5},
timestamp = {Wed, 30 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HochbaumM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HochbaumW86,
author = {Dorit S. Hochbaum and
Edna Wigderson},
title = {The Linzertorte problem, or a unified approach to painting, baking
and weaving},
journal = {Discret. Appl. Math.},
volume = {14},
number = {1},
pages = {17--32},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90004-1},
doi = {10.1016/0166-218X(86)90004-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HochbaumW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HallH86,
author = {Nicholas G. Hall and
Dorit S. Hochbaum},
title = {A fast approximation algorithm for the multicovering problem},
journal = {Discret. Appl. Math.},
volume = {15},
number = {1},
pages = {35--40},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90016-8},
doi = {10.1016/0166-218X(86)90016-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HallH86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/FeoH86,
author = {Thomas A. Feo and
Dorit S. Hochbaum},
title = {{OR} Practice - Lagrangian Relaxation for Testing Infeasibility in
{VLSI} Routing},
journal = {Oper. Res.},
volume = {34},
number = {6},
pages = {819--831},
year = {1986},
url = {https://doi.org/10.1287/opre.34.6.819},
doi = {10.1287/OPRE.34.6.819},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/FeoH86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HochbaumS86,
author = {Dorit S. Hochbaum and
David B. Shmoys},
title = {A unified approach to approximation algorithms for bottleneck problems},
journal = {J. {ACM}},
volume = {33},
number = {3},
pages = {533--550},
year = {1986},
url = {https://doi.org/10.1145/5925.5933},
doi = {10.1145/5925.5933},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HochbaumS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HochbaumNS86,
author = {Dorit S. Hochbaum and
Takao Nishizeki and
David B. Shmoys},
title = {A Better than "Best Possible" Algorithm to Edge Color Multigraphs},
journal = {J. Algorithms},
volume = {7},
number = {1},
pages = {79--104},
year = {1986},
url = {https://doi.org/10.1016/0196-6774(86)90039-8},
doi = {10.1016/0196-6774(86)90039-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HochbaumNS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HochbaumS86,
author = {Dorit S. Hochbaum and
David B. Shmoys},
editor = {Kesav V. Nori},
title = {A Polynomial Approximation Scheme for Machine Scheduling on Uniform
Processors: Using the Dual Approximation Approach},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {241},
pages = {382--393},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17179-7\_23},
doi = {10.1007/3-540-17179-7\_23},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HochbaumS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HochbaumM85,
author = {Dorit S. Hochbaum and
Wolfgang Maass},
title = {Approximation Schemes for Covering and Packing Problems in Image Processing
and {VLSI}},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {130--136},
year = {1985},
url = {https://doi.org/10.1145/2455.214106},
doi = {10.1145/2455.214106},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HochbaumM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HochbaumS85,
author = {Dorit S. Hochbaum and
David B. Shmoys},
title = {A Best Possible Heuristic for the \emph{k}-Center Problem},
journal = {Math. Oper. Res.},
volume = {10},
number = {2},
pages = {180--184},
year = {1985},
url = {https://doi.org/10.1287/moor.10.2.180},
doi = {10.1287/MOOR.10.2.180},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HochbaumS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HochbaumS85,
author = {Dorit S. Hochbaum and
David B. Shmoys},
title = {Using Dual Approximation Algorithms for Scheduling Problems: Theoretical
and Practical Results},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {79--89},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.63},
doi = {10.1109/SFCS.1985.63},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HochbaumS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Hochbaum84,
author = {Dorit S. Hochbaum},
title = {When are NP-hard location problems easy?},
journal = {Ann. Oper. Res.},
volume = {1},
number = {3},
pages = {201--214},
year = {1984},
url = {https://doi.org/10.1007/BF01874389},
doi = {10.1007/BF01874389},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Hochbaum84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HochbaumM84,
author = {Dorit S. Hochbaum and
Wolfgang Maass},
editor = {Max Fontet and
Kurt Mehlhorn},
title = {Approximation Schemes for Covering and Packing Problems in Robotics
and {VLSI}},
booktitle = {{STACS} 84, Symposium of Theoretical Aspects of Computer Science,
Paris, France, 11-13 April, 1984, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {166},
pages = {55--62},
publisher = {Springer},
year = {1984},
url = {https://doi.org/10.1007/3-540-12920-0\_5},
doi = {10.1007/3-540-12920-0\_5},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HochbaumM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HochbaumS84,
author = {Dorit S. Hochbaum and
David B. Shmoys},
editor = {Richard A. DeMillo},
title = {Powers of Graphs: {A} Powerful Approximation Technique for Bottleneck
Problems},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {324--333},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808697},
doi = {10.1145/800057.808697},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HochbaumS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hochbaum83,
author = {Dorit S. Hochbaum},
title = {Efficient bounds for the stable set, vertex cover and set packing
problems},
journal = {Discret. Appl. Math.},
volume = {6},
number = {3},
pages = {243--254},
year = {1983},
url = {https://doi.org/10.1016/0166-218X(83)90080-X},
doi = {10.1016/0166-218X(83)90080-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hochbaum83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Hochbaum82,
author = {Dorit S. Hochbaum},
title = {Heuristics for the fixed cost median problem},
journal = {Math. Program.},
volume = {22},
number = {1},
pages = {148--162},
year = {1982},
url = {https://doi.org/10.1007/BF01581035},
doi = {10.1007/BF01581035},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Hochbaum82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hochbaum82,
author = {Dorit S. Hochbaum},
title = {Approximation Algorithms for the Set Covering and Vertex Cover Problems},
journal = {{SIAM} J. Comput.},
volume = {11},
number = {3},
pages = {555--556},
year = {1982},
url = {https://doi.org/10.1137/0211045},
doi = {10.1137/0211045},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hochbaum82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FisherH80,
author = {Marshall L. Fisher and
Dorit S. Hochbaum},
title = {Database Location in Computer Networks},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {718--735},
year = {1980},
url = {https://doi.org/10.1145/322217.322226},
doi = {10.1145/322217.322226},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FisherH80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/FisherH80,
author = {Marshall L. Fisher and
Dorit S. Hochbaum},
title = {Probabilistic Analysis of the Planar \emph{k}-Median Problem},
journal = {Math. Oper. Res.},
volume = {5},
number = {1},
pages = {27--34},
year = {1980},
url = {https://doi.org/10.1287/moor.5.1.27},
doi = {10.1287/MOOR.5.1.27},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/FisherH80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:39 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:
