Výsledky vyhledávání - "Distributed approximation algorithm"

An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique

Autoři: Parikshit Saikia

Zdroj: 2024 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT). :179-186

A Distributed Approximation Algorithm for the Total Dominating Set Problem

Autoři: Limin Wang Zhao Zhang Donglei Du a další

Zdroj: Lecture Notes in Computer Science ISBN: 9789819777976

A simple 2(1-1/ l ) factor distributed approximation algorithm for steiner tree in the CONGEST model

Autoři: Sushanta Karmakar Parikshit Saikia

Zdroj: Proceedings of the 20th International Conference on Distributed Computing and Networking. :41-50

Témata: 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/icdcn/icdcn2019.html#SaikiaK19
https://dl.acm.org/citation.cfm?id=3288629
https://dl.acm.org/doi/pdf/10.1145/3288599.3288629

An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks

Autoři: Hua, Q Yu, D Wang, Y a další

Zdroj: 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems. :132-139

Témata: Unstructured wireless networks, Randomized algorithm, Local broadcasting, Distributed algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy, Sinr model

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/dcoss/dcoss2012.html#YuHWL12
https://www.dcoss.org/dcoss12_files/hua%20DCOSS%202012PPT.pdf
http://hub.hku.hk/handle/10722/169308
https://iiis.tsinghua.edu.cn/~qshua/dcoss2012.pdf
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006227734
https://ieeexplore.ieee.org/document/6227734/
http://hdl.handle.net/10722/169308

A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem

Autoři: Peng Du Yuan Zhang

Zdroj: Mathematical Problems in Engineering. 2016:1-10

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Popis souboru: text/xhtml

Přístupová URL adresa: http://downloads.hindawi.com/journals/mpe/2016/9790629.pdf
http://downloads.hindawi.com/journals/mpe/2016/9790629.pdf
https://core.ac.uk/display/89627272
https://downloads.hindawi.com/journals/mpe/2016/9790629.pdf
https://www.hindawi.com/journals/mpe/2016/9790629/

An effective distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

Autoři: Bo Gao Huiye Ma Yuhang Yang

Zdroj: Lecture Notes in Computer Science ISBN: 9783540241287

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, 7. Clean energy

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/ijcomsys/ijcomsys18.html#GaoYM05
http://onlinelibrary.wiley.com/doi/10.1002/dac.726/abstract
https://dblp.uni-trier.de/db/conf/IEEEcit/IEEEcit2004.html#GaoYM04
https://link.springer.com/chapter/10.1007%2F978-3-540-30566-8_42
http://ieeexplore.ieee.org/document/1357270/
https://rd.springer.com/chapter/10.1007/978-3-540-30566-8_42
https://dl.acm.org/doi/10.1007/978-3-540-30566-8_42
https://link.springer.com/content/pdf/10.1007%2F978-3-540-30566-8_42.pdf

A Fast Distributed Approximation Algorithm for Minimum Spanning Trees

Autoři: Maleq Khan Gopal Pandurangan

Zdroj: Lecture Notes in Computer Science ISBN: 9783540446248

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy

Přístupová URL adresa: https://link.springer.com/chapter/10.1007%2F11864219_25
https://dblp.uni-trier.de/db/conf/wdag/disc2006.html#KhanP06
https://rd.springer.com/chapter/10.1007/11864219_25
http://dblp.uni-trier.de/db/conf/wdag/disc2006.html#KhanP06
http://core.ac.uk/display/23440378
https://dblp.uni-trier.de/db/journals/dc/dc20.html#KhanP08
https://link.springer.com/article/10.1007%2Fs00446-007-0047-8

An improved distributed approximation algorithm for minimum connected dominating set

Autoři: Ying Zhang Shenyong Gao

Zdroj: 2012 8th International Conference on Natural Computation. :1019-1022

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006234531
https://dblp.uni-trier.de/db/conf/icnc/icnc2012.html#GaoZ12
https://ieeexplore.ieee.org/document/6234531/

A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET

Autoři: Hirotsugu Kakugawa Sayaka Kamei

Zdroj: International Journal of Foundations of Computer Science. 21:459-476

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://www.cecs.uci.edu/~papers/ipdps07/pdfs/APDCM-04-paper-2.pdf
https://ieeexplore.ieee.org/document/4228192/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004228192
https://dblp.uni-trier.de/db/conf/ipps/ipdps2007.html#KameiK07
https://doi.org/10.1109/IPDPS.2007.370464
http://www.cecs.uci.edu/~papers/ipdps07/pdfs/APDCM-04-paper-2.pdf
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4228192
https://www.worldscientific.com/doi/abs/10.1142/S0129054110007362
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs21.html#KameiK10

A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION

Autoři: Xu, S. Shen, H.

Zdroj: International Journal of Foundations of Computer Science. 22:1019-1034

Témata: distributed algorithms, metric facility location problem, 11. Sustainability, 0211 other engineering and technologies, fault tolerance, 0102 computer and information sciences, 02 engineering and technology, 7. Clean energy, 01 natural sciences, Approximation algorithms

Přístupová URL adresa: https://www.worldscientific.com/doi/abs/10.1142/S0129054111008544
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs22.html#XuS11

A distributed approximation algorithm for the bottleneck connected dominating set problem

Autoři: Sergiy Butenko Anurag Verma

Zdroj: Optimization Letters. 6:1583-1595

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/article/10.1007%2Fs11590-011-0314-2
http://dblp.uni-trier.de/db/journals/ol/ol6.html#VermaB12
https://doi.org/10.1007/s11590-011-0314-2
https://dblp.uni-trier.de/db/journals/ol/ol6.html#VermaB12
https://link.springer.com/content/pdf/10.1007%2Fs11590-011-0314-2.pdf

A distributed approximation algorithm for the minimum degree minimum weight spanning trees

Autoři: Lavault, Christian Valencia-Pabon, Mario Laboratoire d'Informatique de Paris-Nord (LIPN) a další

Přispěvatelé: Lavault, Christian Valencia-Pabon, Mario Laboratoire d'Informatique de Paris-Nord (LIPN) a další

Zdroj: Journal of Parallel and Distributed Computing. 68:200-208

Témata: distributed approximation, FOS: Computer and information sciences, [INFO.INFO-DC]Computer Science [cs]/Distributed, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Parallel, minimum degree minimum weight spanning trees, complexity analysis, 01 natural sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], and Cluster Computing [cs.DC], Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/cs/0607031
http://arxiv.org/abs/cs/0607031
https://hal.science/hal-00084600v1/document
https://hal.science/hal-00084600v1

Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree

Autoři: Sushanta Karmakar Aris Pagourtzis Parikshit Saikia

Zdroj: Discrete Mathematics, Algorithms and Applications. 13:2150008

Témata: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), 14. Life underwater, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/1710.07040
http://arxiv.org/abs/1710.07040

A Primal-Dual based Distributed Approximation Algorithm for Prize-Collecting Steiner Tree

Autoři: Saikia, Parikshit Karmakar, Sushanta Pagourtzis, Aris T.

Témata: Computer Science - Distributed, Parallel, and Cluster Computing, text

URL: http://arxiv.org/abs/1710.07040

Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs

Autoři: Andrzej Czygrinow Edyta Szymańska Michał Hańćkowiak

Zdroj: Lecture Notes in Computer Science ISBN: 9783642106309

Přístupová URL adresa: https://math.la.asu.edu/~andrzej/papers/ISAAC09/isaac09.pdf
http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#CzygrinowHS09
https://rd.springer.com/chapter/10.1007/978-3-642-10631-6_68
https://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#CzygrinowHS09
https://asu.pure.elsevier.com/en/publications/fast-distributed-approximation-algorithm-for-the-maximum-matching
https://doi.org/10.1007/978-3-642-10631-6_68

A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks

Autoři: Christine Markarian Friedhelm Meyer auf der Heide Michael Schubert

Zdroj: Lecture Notes in Computer Science ISBN: 9783642453458

Přístupová URL adresa: https://link.springer.com/chapter/10.1007/978-3-642-45346-5_16
https://link.springer.com/10.1007/978-3-642-45346-5_16
https://link.springer.com/chapter/10.1007/978-3-642-45346-5_16/fulltext.html
https://rd.springer.com/chapter/10.1007%2F978-3-642-45346-5_16
https://doi.org/10.1007/978-3-642-45346-5_16

Distributed Approximation Algorithm for Resource Clustering

Autoři: Beaumont, Olivier Bonichon, Nicolas Duchon, Philippe a další

Přispěvatelé: Beaumont, Olivier Bonichon, Nicolas Duchon, Philippe a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783540693260

Témata: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://hal.science/hal-00323068v1
https://hal.archives-ouvertes.fr/hal-00323068
https://dblp.uni-trier.de/db/conf/sirocco/sirocco2008.html#BeaumontBDL08
https://link.springer.com/content/pdf/10.1007%2F978-3-540-69355-0_7.pdf
https://rd.springer.com/chapter/10.1007/978-3-540-69355-0_7
https://link.springer.com/chapter/10.1007/978-3-540-69355-0_7

Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model

Autoři: Guanhong Pei Maleq Khan Gopal Pandurangan a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642336508

Přístupová URL adresa: https://rd.springer.com/chapter/10.1007/978-3-642-33651-5_32
https://link.springer.com/chapter/10.1007/978-3-642-33651-5_32
https://link.springer.com/10.1007/978-3-642-33651-5_32

A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model

Autoři: Khan, Maleq Kumar, V. S. Anil Pandurangan, Gopal a další

Témata: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, C.2.4, F.2.2, text

URL: http://arxiv.org/abs/1206.1113

A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model

Autoři: Briest, Patrick Degener, Bastian Kempkes, Barbara a další

Témata: Computer Science - Distributed, Parallel, and Cluster Computing, text

URL: http://arxiv.org/abs/1105.1248