Výsledky vyhľadávania - purely combinatorial polynomial algorithms

Purely combinatorial approximation algorithms for maximum [formula omitted]-vertex cover in bipartite graphs.

Autori: Bonnet, Édouard Escoffier, Bruno Paschos, Vangelis Th. a ďalší

Zdroj: Discrete Optimization. Feb2018, Vol. 27, p26-56. 31p.

Predmety: Approximation theory, Bipartite graphs, Polynomials, Geometric vertices, Combinatorics

Purely Combinatorial Algorithms for Approximate Directed Minimum Degree Spanning Trees

Autori: Duan, Ran Zhang, Tianyi

Témy: Computer Science - Data Structures and Algorithms, text

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

A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs

Autori: Bonnet, Edouard Escoffier, Bruno Paschos, Vangelis a ďalší

Témy: Computer Science - Data Structures and Algorithms, text

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

Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms

Autori: Li, Shi

Témy: Computer Science - Data Structures and Algorithms, text

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

Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost: Scaling methods for finding a maximum free multiflow of minimum cost

Autori: Andrew V. Goldberg Alexander V. Karzanov

Zdroj: Mathematics of Operations Research. 22:90-109

Predmety: undirected graph, Combinatorial optimization, half-integer optimal solution, Deterministic network models in operations research, purely combinatorial polynomial algorithms, 0211 other engineering and technologies, 02 engineering and technology, nonnegative integer-valued edge capacities

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1018446
https://doi.org/10.1287/moor.22.1.90

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

Autori: Édouard Bonnet Vangelis Th. Paschos Bruno Escoffier a ďalší

Prispievatelia: Édouard Bonnet Vangelis Th. Paschos Bruno Escoffier a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783662495285

Predmety: FOS: Computer and information sciences, Greedy approaches, Vertex Cover problems, Combinatorial mathematics, Polynomial approximation, Computer-assisted analysis, 0211 other engineering and technologies, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, information science, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, Approximation algorithms, Graph theory, Vertex cover, Computer Science - Data Structures and Algorithms, Combinatorial algorithm, Data Structures and Algorithms (cs.DS), Computer Aided Analysis, Algorithms, Polynomial time approximation, Bipartite graphs

Popis súboru: text

Prístupová URL adresa: http://eprints.sztaki.hu/9072/1/Bonnet_235_3173339_ny.pdf
http://arxiv.org/abs/1409.6952
https://hal.archives-ouvertes.fr/hal-01343951
https://link.springer.com/content/pdf/10.1007%2F978-3-662-49529-2_18.pdf
https://rd.springer.com/chapter/10.1007/978-3-662-49529-2_18
https://eprints.sztaki.hu/9072/
https://link.springer.com/chapter/10.1007%2F978-3-662-49529-2_18
https://doi.org/10.1007/978-3-662-49529-2_18
https://eprints.sztaki.hu/9072/

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs

Autori: Bonnet, Edouard Escoffier, Bruno Paschos, Vangelis Th. a ďalší

Prispievatelia: Bonnet, Edouard Escoffier, Bruno Paschos, Vangelis Th. a ďalší

Zdroj: Discrete Optimization. 27:26-56

Predmety: Maximum coverage, Programmation, 0211 other engineering and technologies, Non linear program, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 7. Clean energy, 01 natural sciences, Approximation algorithms, organisation des données, 13. Climate action, Combinatorial algorithms, [INFO]Computer Science [cs], MAX-CUT, Graph algorithms, logiciels

Prístupová URL adresa: https://cris.maastrichtuniversity.nl/en/publications/8d19f08a-7355-4768-b448-5eda9b3dcfb4
https://doi.org/10.1016/j.disopt.2017.09.001
https://cris.maastrichtuniversity.nl/en/publications/purely-combinatorial-approximation-algorithms-for-maximum-k-verte
https://dblp.uni-trier.de/db/journals/disopt/disopt27.html#BonnetEPS18
https://core.ac.uk/display/153358274
https://doi.org/10.1016/j.disopt.2017.09.001
https://www.sciencedirect.com/science/article/pii/S1572528617301950
http://www.sciencedirect.com/science/article/pii/S1572528617301950
https://hal.science/hal-02073599v1
https://doi.org/10.1016/j.disopt.2017.09.001

A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems: A strongly polynomial algorithm for minimum cost submodular flow problems

Autori: Satoru Fujishige Hans Röck Uwe Zimmermann

Zdroj: Mathematics of Operations Research. 14:60-69

Predmety: minimum cost submodular flow, Analysis of algorithms and problem complexity, scaling, Deterministic network models in operations research, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, tree projection, purely combinatorial strongly polynomial algorithm, 01 natural sciences

Popis súboru: application/xml

Fine costs for Euclid's algorithm on polynomials and Farey maps

Autori: Berthé, Valérie Nakada, Hitoshi Natsui, Rie a ďalší

Prispievatelia: Berthé, Valérie Nakada, Hitoshi Natsui, Rie a ďalší

Zdroj: Advances in Applied Mathematics. 54:27-65

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Combinatorial analysis, Bivariate generating functions, Continued fractions, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Finite field, Bit-complexity, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Farey map, 0102 computer and information sciences, [INFO] Computer Science [cs], 16. Peace & justice, 01 natural sciences, Cost function, 8. Economic growth, [INFO]Computer Science [cs], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0101 mathematics, Laurent formal power series

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.science/hal-01086629v1
https://doi.org/10.1016/j.aam.2013.11.001
https://hal.science/hal-01086629v1/document
https://hal.archives-ouvertes.fr/hal-01086629/document
http://dblp.uni-trier.de/db/journals/aam/aam54.html#BertheNNV14
https://keio.pure.elsevier.com/en/publications/fine-costs-for-euclids-algorithm-on-polynomials-and-farey-maps
https://www.sciencedirect.com/science/article/pii/S0196885813001280
https://hal.archives-ouvertes.fr/hal-01086629

Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms

Autori: Li, Shi

Zdroj: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611976465

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.178
http://arxiv.org/abs/2004.01231

A new perspective on single-machine scheduling problems with late work related criteria.

Autori: Shabtay, Dvir¹ (AUTHOR) dvirs@bgu.ac.il

Zdroj: Annals of Operations Research. Mar2023, Vol. 322 Issue 2, p947-966. 20p.

Predmety: *COST functions, *POLYNOMIAL time algorithms, *SCHEDULING, *ECONOMIC lot size, *WORKING hours

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and $\ell_\infty$-norm objectives

Autori: Bérczi, Kristóf Mendoza-Cadena, Lydia Mirabel Varga, Kitti

Témy: Mathematics - Optimization and Control, Computer Science - Discrete Mathematics, text

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

Metric Violation Distance: Hardness and Approximation.

Autori: Fan, Chenglin Raichel, Benjamin Buskirk, Gregory Van

Zdroj: Algorithmica. May2022, Vol. 84 Issue 5, p1441-1465. 25p.

Predmety: *POLYNOMIAL time algorithms, *HARDNESS, *MEASUREMENT errors, *APPROXIMATION algorithms

Combinatorial Algorithms : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers

Autori: Ljiljana Brankovic Joe Ryan William F. Smyth

Typ zdroja: eBook.

Predmet: Computer science—Mathematics, Discrete mathematics, Algorithms, Artificial intelligence—Data processing, Artificial intelligence, Numerical analysis, Data protection

Kategórie: COMPUTERS / Computer Science, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Database Administration & Management, COMPUTERS / Programming / Algorithms, COMPUTERS / Security / General, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives

Autori: Kristóf Bérczi Lydia Mirabel Mendoza-Cadena Kitti Varga

Zdroj: Optimization Letters.

Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Optimization and Control (math.OC), 0211 other engineering and technologies, FOS: Mathematics, 02 engineering and technology, Mathematics - Optimization and Control, Computer Science - Discrete Mathematics

Prístupová URL adresa: http://arxiv.org/abs/2302.13411

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously

Autori: Kaul, Matthias Luo, Kelin Mnich, Matthias a ďalší

Témy: Computer Science - Data Structures and Algorithms, text

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

A Combinatorial Tale of Two Scattering Amplitudes: See Two Bijections

Autori: Hu, Simone

Témy: Mathematics - Combinatorics, High Energy Physics - Theory, Mathematical Physics, 05E14, 81T18 (Primary) 81Q30, 05C31, 05C30, 05A19 (Secondary), text

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

Bayesian generalized network design.

Autori: Emek, Yuval Kutten, Shay Lavi, Ron a ďalší

Zdroj: Theoretical Computer Science. Nov2020, Vol. 841, p167-185. 19p.

Predmety: *POLYNOMIAL time algorithms, *COST shifting, *DECISION making

A network flow approach to a common generalization of Clar and Fries numbers.

Autori: Bérczi-Kovács, Erika Frank, András

Zdroj: Discrete Mathematics. Nov2024, Vol. 347 Issue 11, pN.PAG-N.PAG. 1p.

Predmety: *POLYNOMIAL time algorithms, *POLYHEDRA, *GENERALIZATION, *BIPARTITE graphs, *ALGORITHMS, *POLYNOMIALS, *DIRECTED graphs

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Autori: Michał Pilipczuk Erik Jan van Leeuwen Andreas Wiese a ďalší

Prispievatelia: Michał Pilipczuk Erik Jan van Leeuwen Andreas Wiese a ďalší

Zdroj: Algorithmica. 82:1703-1739

Predmety: Approximation schemes, FOS: Computer and information sciences, Planar graphs, planar graphs, Geometric set cover, Independent set of objects, 68W25 (Approximation algorithms), Taverne, Computer Science - Data Structures and Algorithms, QPTAS, Data Structures and Algorithms (cs.DS), ddc:004, Voronoi diagram

Popis súboru: application/pdf; image/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/9528/pdf/LIPIcs-ESA-2018-65.pdf
http://arxiv.org/abs/1807.07626
https://research-portal.uu.nl/en/publications/6c84934d-7417-4c67-a2ad-9e596f076ca5
https://doi.org/10.4230/LIPIcs.ESA.2018.65
http://dspace.library.uu.nl/handle/1874/396253
https://dblp.uni-trier.de/db/journals/corr/corr1807.html#abs-1807-07626
https://link.springer.com/article/10.1007/s00453-019-00670-w
https://doi.org/10.1007/s00453-019-00670-w
https://link.springer.com/content/pdf/10.1007/s00453-019-00670-w.pdf
https://arxiv.org/abs/1807.07626
https://drops.dagstuhl.de/opus/volltexte/2018/9528/
https://drops.dagstuhl.de/opus/volltexte/2018/9528/pdf/LIPIcs-ESA-2018-65.pdf
https://repositorio.uchile.cl/handle/2250/169565
https://paperity.org/p/160752981/quasi-polynomial-time-approximation-schemes-for-packing-and-covering-problems-in-planar
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F376896
https://dspace.library.uu.nl/handle/1874/376896
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.65
https://dspace.library.uu.nl/handle/1874/376896
https://dspace.library.uu.nl/handle/1874/396253