Deterministic Rounding is an approximation algorithm design technique that belongs to the class of rounding methods, distinguished by its systematic and non-random transformation of fractional solutions obtained from relaxed mathematical programs into integer solutions through predefined, deterministic rules.
24
Publications
1.6K
Citations
72
Authors
37
Institutions
Publications per year
2017–2026
9
Parents
Publications
24
Moses Charikar, Chandra Chekuri, Ashish Goel et al. · 1998 · 136 citations
A general approach to online network optimization problems
Noga Alon, Baruch Awerbuch, Yossi Azar et al. · ACM Transactions on Algorithms · 2006 · 116 citations
1–5 of 24
Authors
72
- CHCharles Hadfield
IBM Research - Thomas J. Watson Research Center, United States
2 publications · 31 citations
2
h-index
- RR
2
h-index
- TI
2
h-index
- AW
2
h-index
- YA
2
h-index
1–5 of 72
Institutions
37
Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
273 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
4 publications
256 citations
Johns Hopkins University
Baltimore, United States
2 h-index
2 publications
128 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
5 publications
195 citations
University of Freiburg
Freiburg im Breisgau, Germany
1 h-index
2 publications
34 citations
Cornell University
Ithaca, United States
1 h-index
1 publications
14 citations
Virginia Tech
Blacksburg, United States
1 h-index
2 publications
50 citations
Università Cattolica del Sacro Cuore
Milan, Italy
1 h-index
1 publications
12 citations
1–8 of 37
Venues
- arXiv (Cornell University)
Repository · 2 publications · 26 citations
2
h-index
- SIAM Journal on Computing
2 publications · 173 citations
2
h-index
- Symposium on Discrete Algorithms
Conference · 1 publications · 12 citations
1
h-index
- Journal of Computer and System Sciences
1 publications · 552 citations
1
h-index
- Discrete Optimization
1 publications · 16 citations
1
h-index
1–5