Výsledky vyhledávání - "constant-factor approximation algorithms"

A constant-factor approximation for weighted bond cover

Autoři: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M. a další

Přispěvatelé: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M. a další

Zdroj: Journal of Computer and System Sciences. 149:103617

Témata: FOS: Computer and information sciences, F.2.2, G.2.2, Graph minors, 0102 computer and information sciences, 01 natural sciences, Constant-factor approximation algorithms, Primal-dual method, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Graph modification problems, Bonds in graphs, 05C35, 05C83, 05C85, 68R10, 68W25

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2105.00857
https://drops.dagstuhl.de/opus/volltexte/2021/14700/
https://drops.dagstuhl.de/opus/volltexte/2021/14700/pdf/LIPIcs-APPROX7.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-00857
https://arxiv.org/abs/2105.00857
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.7

Packing Under Convex Quadratic Constraints

Autoři: Max Klimm Marc E. Pfetsch Rico Raber a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783030457709

Témata: constant-factor approximation algorithms, Optimization and Control (math.OC), 500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik, greedy strategy, FOS: Mathematics, 0211 other engineering and technologies, convex quadratic constraints, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, Mathematics - Optimization and Control, 01 natural sciences

Popis souboru: text

Přístupová URL adresa: http://arxiv.org/pdf/1912.00468
https://link.springer.com/content/pdf/10.1007/s10107-021-01675-6.pdf
http://arxiv.org/abs/1912.00468
https://link.springer.com/article/10.1007/s10107-021-01675-6
https://rd.springer.com/chapter/10.1007/978-3-030-45771-6_21
https://link.springer.com/content/pdf/10.1007%2F978-3-030-45771-6_21.pdf
https://link.springer.com/content/pdf/10.1007/s10107-021-01675-6.pdf
https://dblp.uni-trier.de/db/conf/ipco/ipco2020.html#KlimmPRS20
https://tuprints.ulb.tu-darmstadt.de/23454/1/s10107-021-01675-6.pdf

Packing under convex quadratic constraints

Autoři: Klimm, Max Pfetsch, Marc E. Raber, Rico a další

Témata: 500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik, convex quadratic constraints, constant-factor approximation algorithms, greedy strategy

Popis souboru: application/pdf

Dostupnost: https://depositonce.tu-berlin.de/handle/11303/18462
https://doi.org/10.14279/depositonce-17271

A Constant-Factor Approximation for Weighted Bond Cover

Autoři: Kim, Eun, Jung Lee, Euiwoong Thilikos, Dimitrios M. a další

Přispěvatelé: Kim, Eun, Jung Lee, Euiwoong Thilikos, Dimitrios M. a další

Zdroj: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021) ; APPROX/RANDOM 2021 - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ; https://hal.science/hal-03390188 ; APPROX/RANDOM 2021 - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Aug 2021, Seattle, United States. pp.7:1--7:14, ⟨10.4230/LIPIcs.APPROX/RANDOM.2021.7⟩

Témata: Constant-factor approximation algorithms, Primal-dual method, Bonds in graphs, Graph minors, Graph modification problems, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geografické téma: Seattle, United States

Dostupnost: https://hal.science/hal-03390188
https://hal.science/hal-03390188v1/document
https://hal.science/hal-03390188v1/file/LIPIcs-APPROX7.pdf
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.7

Towards a characterization of constant-factor approximable min CSPs

Autoři: Dalmau, V. Krokhin, A. Manokaran, Rajsekar

Zdroj: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :847-857

Témata: Algebra, Approximation algorithms, Probability distributions, Algebraic approaches, Algebraic conditions, Constant factor approximation, Constant-factor approximation algorithms, Constraint language, Stable distributions, Technical conditions, Unique games conjecture, Constraint satisfaction problems

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280537
https://doi.org/10.1137/1.9781611973730.58

The bundled crossing number

Autoři: Alam, M. J. Fink, M. Pupyrev, S.

Zdroj: Lect. Notes Comput. Sci. ; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Témata: APPROXIMATION ALGORITHMS, DRAWING (GRAPHICS), VISUALIZATION, ALGORITHMIC ASPECTS, APPROXIMATION FACTOR, CONSTANT-FACTOR APPROXIMATION ALGORITHMS, CROSSING NUMBER, MINIMIZING THE NUMBER OF, MULTIPLE CROSSINGS, ORIENTABLE GENUS, SELF-INTERSECTIONS, GRAPH THEORY

Popis souboru: application/pdf

Relation: 3029743; Final; All Open Access, Green; http://elar.urfu.ru/handle/10995/102766; 85007303442; 000405478500031

Dostupnost: http://elar.urfu.ru/handle/10995/102766
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85007303442&doi=10.1007%2f978-3-319-50106-2_31&partnerID=40&md5=a652b0a43f6c88908335788396b8ddfb
https://doi.org/10.1007/978-3-319-50106-2_31

Minimizing average completion time in the presence of release dates

Autoři: Clifford Stein Cynthia A. Phillips Joel Wein

Zdroj: Mathematical Programming. 82:199-223

Témata: constant-factor approximation algorithms, Deterministic scheduling theory in operations research, Linear programming, 0211 other engineering and technologies, average weighted completion time, 0102 computer and information sciences, 02 engineering and technology, relaxations, NP-hard, preemptive and nonpreemptive schedules, 01 natural sciences, average completion time, parallel machine models

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1294691
https://doi.org/10.1007/bf01585872

1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor

Autoři: Demaine, Erik D. Hajiaghayi, Mohammad Taghi Thilikos Touloupas, Dimitrios a další

Přispěvatelé: Demaine, Erik D. Hajiaghayi, Mohammad Taghi Thilikos Touloupas, Dimitrios a další

Témata: Àrees temàtiques de la UPC::Informàtica, Treewidth of graphs, Polynomial-time constant-factor approximation algorithms

Popis souboru: 11 p.; application/postscript

Relation: LSI-02-40-R; http://hdl.handle.net/2117/97497

Dostupnost: http://hdl.handle.net/2117/97497

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

Autoři: Beyer, S. Chimani, M. Spoerhase, J. a další

Přispěvatelé: Beyer, S. Chimani, M. Spoerhase, J. a další

Témata: Combinatorial mathematics, Graph algorithms, Iterative methods, Approximation factor, Combinatorial algorithm, Connectivity problems, Constant-factor approximation algorithms, Primal dual algorithms, Primal-dual approach, Primal-dual approximation algorithm, Survivable network design, Approximation algorithms

Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); https://osnascholar.ub.uni-osnabrueck.de/handle/unios/18383; 2-s2.0-85091104639; https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091104639&doi=10.1007%2f978-3-030-58150-3_28&partnerID=40&md5=e56d2fc3a590dc9b744088fc33458100

Dostupnost: https://osnascholar.ub.uni-osnabrueck.de/handle/unios/18383
https://doi.org/10.1007/978-3-030-58150-3_28
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091104639&doi=10.1007%2f978-3-030-58150-3_28&partnerID=40&md5=e56d2fc3a590dc9b744088fc33458100

How to eat a graph: Computing selection sequences for the continuous generalization of road networks

Autoři: Chimani, M. Van Dijk, T.C. Haunert, J.-H. a další

Přispěvatelé: Chimani, M. Van Dijk, T.C. Haunert, J.-H. a další

Témata: Approximation algorithms, Continuous generalization, Generalized map, Geographic information systems, Information systems, Integer linear programs, Integer programming, Map generalization, Motor transportation, Optimization, Road segments, Roads and streets, Scheduling, Selection sequences, Transportation, Constant-factor approximation algorithms, Weighted graph

Relation: GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems; https://osnascholar.ub.uni-osnabrueck.de/handle/unios/17439; 2-s2.0-84961201791; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961201791&doi=10.1145%2f2666310.2666414&partnerID=40&md5=e368ca9bdcaa81f5637510b006f0ef4f

Dostupnost: https://osnascholar.ub.uni-osnabrueck.de/handle/unios/17439
https://doi.org/10.1145/2666310.2666414
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961201791&doi=10.1145%2f2666310.2666414&partnerID=40&md5=e368ca9bdcaa81f5637510b006f0ef4f

A Constant-Factor Approximation for Weighted Bond Cover

Autoři: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M.

Témata: Constant-factor approximation algorithms, Primal-dual method, Bonds in graphs, Graph minors, Graph modification problems, Data processing Computer science, InProceedings, publishedVersion

1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor

Autoři: Universitat Politècnica de Catalunya. Departament de Ciències de la Computació Demaine, Erik D. Hajiaghayi, Mohammad Taghi a další

Témata: Àrees temàtiques de la UPC::Informàtica, Treewidth of graphs, Polynomial-time constant-factor approximation algorithms, External research report

URL: https://hdl.handle.net/2117/97497
LSI-02-40-R