Diakonikolas, Jelena; Fazel, Maryam; Orecchia, Lorenzo Fair packing and covering on a relative scale. (English) Zbl 1491.90099 SIAM J. Optim. 30, No. 4, 3284-3314 (2020). Reviewer: Yisheng Song (Hong Kong) MSC: 90C06 90C25 49N15 65K05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Dinitz, Michael; Nazari, Yasamin Distributed distance-bounded network design through distributed convex programming. (English) Zbl 1487.68251 Aspnes, James (ed.) et al., 21st international conference on principles of distributed systems, OPODIS 2017, Lisboa, Portugal, December 18–20, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 95, Article 5, 19 p. (2018). MSC: 68W15 68M10 68W25 90C25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ghaffari, Mohsen; Kuhn, Fabian; Maus, Yannic On the complexity of local distributed graph problems. (English) Zbl 1370.68127 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 784-797 (2017). MSC: 68Q25 05C85 68Q10 68Q15 68W15 68W20 90C10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bei, Xiaohui; Chen, Ning; Zhang, Shengyu Solving linear programming with constraints unknown. (English) Zbl 1440.90020 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 129-142 (2015). MSC: 90C05 52B55 68Q25 68U05 90C59 90C60 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Drwal, Maciej; Jozefczyk, Jerzy Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding. (English) Zbl 1303.90115 Ann. Oper. Res. 222, 261-277 (2014). MSC: 90C35 90C10 90C20 90C90 × Cite Format Result Cite Review PDF Full Text: DOI
Koufogiannakis, Christos; Young, Neal E. Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost. (English) Zbl 1285.68215 Algorithmica 66, No. 1, 113-152 (2013). MSC: 68W25 90C27 90C10 90C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Khan, Maleq; Kuhn, Fabian; Malkhi, Dahlia; Pandurangan, Gopal; Talwar, Kunal Efficient distributed approximation algorithms via probabilistic tree embeddings. (English) Zbl 1259.68228 Distrib. Comput. 25, No. 3, 189-205 (2012). MSC: 68W15 68W25 68P05 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Floréen, Patrik; Hassinen, Marja; Kaasinen, Joel; Kaski, Petteri; Musto, Topi; Suomela, Jukka Local approximability of max-min and min-max linear programs. (English) Zbl 1253.68360 Theory Comput. Syst. 49, No. 4, 672-697 (2011). MSC: 68W25 68W15 90C05 90C47 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI Link
Hassinen, Marja; Kaasinen, Joel; Kranakis, Evangelos; Polishchuk, Valentin; Suomela, Jukka; Wiese, Andreas Analysing local algorithms in location-aware quasi-unit-disk graphs. (English) Zbl 1228.05273 Discrete Appl. Math. 159, No. 15, 1566-1580 (2011). MSC: 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Emek, Yuval; Halldórsson, Magnús M.; Mansour, Yishay; Patt-Shamir, Boaz; Radhakrishnan, Jaikumar; Rawitz, Dror Online set packing and competitive scheduling of multi-part tasks. (English) Zbl 1315.68035 Proceedings of the 29th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC ’10, Zurich, Switzerland, July 25–28, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-888-9). 440-449 (2010). MSC: 68M20 68Q25 68W15 68W20 68W27 × Cite Format Result Cite Review PDF Full Text: DOI
Koutsoupias, Elias The \(k\)-server problem. (English) Zbl 1302.68329 Comput. Sci. Rev. 3, No. 2, 105-118 (2009). MSC: 68W27 68M20 90B22 68-02 × Cite Format Result Cite Review PDF Full Text: DOI
Polishchuk, Valentin; Suomela, Jukka A simple local 3-approximation algorithm for vertex cover. (English) Zbl 1214.68468 Inf. Process. Lett. 109, No. 12, 642-645 (2009). MSC: 68W25 05C85 68W15 × Cite Format Result Cite Review PDF Full Text: DOI Link
Auer, Peter; Cesa-Bianchi, Nicolò A distributed voting scheme to maximize preferences. (English) Zbl 1112.68133 Theor. Inform. Appl. 40, No. 2, 389-403 (2006). MSC: 68W15 68W20 91B12 × Cite Format Result Cite Review PDF Full Text: DOI Numdam EuDML Link
Moscibroda, Thomas; Wattenhofer, Rogert Facility location, distributed approximation. (English) Zbl 1314.68386 Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC ’05, Las Vegas, NV, USA, July 17–20, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-994-2). 108-117 (2005). MSC: 68W15 05C85 68Q17 68R10 68W25 90B85 90C05 × Cite Format Result Cite Review PDF Full Text: DOI
Asratian, A. S.; Kuzjurin, N. N. Two sensitivity theorems in fuzzy integer programming. (English) Zbl 1043.90049 Discrete Appl. Math. 134, No. 1-3, 129-140 (2004). MSC: 90C10 90C31 90C70 × Cite Format Result Cite Review PDF Full Text: DOI
Albers, Susanne; Charikar, Moses; Mitzenmacher, Michael Delayed information and action in on-line algorithms. (English) Zbl 1005.68070 Inf. Comput. 170, No. 2, 135-152 (2001). MSC: 68Q10 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Nisan, Noam; Ronen, Amir Algorithmic mechanism design. (English) Zbl 0996.68251 Games Econ. Behav. 35, No. 1-2, 166-196 (2001). MSC: 68W15 68M14 68W25 91A10 × Cite Format Result Cite Review PDF Full Text: DOI Link
Nisan, Noam; Ronen, Amir Algorithmic mechanism design (extended abstract). (English) Zbl 1346.68246 Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 129-140 (1999). MSC: 68W01 68Q17 68W15 68W20 68W25 × Cite Format Result Cite Review PDF Full Text: DOI
Crescenzi, Pierluigi; Trevisan, Luca On the distributed decision-making complexity of the minimum vertex cover problem. (English) Zbl 0876.68101 RAIRO, Inform. Théor. Appl. 30, No. 5, 431-441 (1996). MSC: 68T20 68R10 68W10 × Cite Format Result Cite Review PDF Full Text: DOI EuDML
Crescenzi, Pierluigi; Trevisan, Luca Minimum vertex cover, distributed decision-making, and communication complexity. (English) Zbl 1528.68282 Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 130-139 (1995). MSC: 68R10 05C70 68Q11 68W15 × Cite Format Result Cite Review PDF Full Text: DOI
Deng, Xiaotie Distributed near-optimal matching. (English) Zbl 1498.90187 Balas, Egon (ed.) et al., Integer programming and combinatorial optimization. 4th international IPCO conference, Copenhagen, Denmark, May 29–31, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 920, 135-144 (1995). MSC: 90C27 × Cite Format Result Cite Review PDF Full Text: DOI