Suchergebnisse - polytime (dynamic OR dynamika) programming algorithms

b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs

Autoren: Bonomo, Flavia Schaudt, Oliver Stein, Maya et al.

Weitere Verfasser: Bonomo, Flavia Schaudt, Oliver Stein, Maya et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783319091730
Conicyt_qa
ANID
instacron:ANID
Algorithmica
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
Articulos_ANID
Agencia Nacional de Investigación y Desarrollo

Schlagwörter: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, [MATH] Mathematics [math], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO] Computer Science [cs], Computational Complexity (cs.CC), Co-triangle-free graphs, 01 natural sciences, 7. Clean energy, Stability number two, Treecographs, Minimum Maxinal Matching, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], NP-hardness, FOS: Mathematics, Mathematics - Combinatorics, [INFO]Computer Science [cs], Polytime dynamic programming algorithms, [MATH]Mathematics [math], B-Coloring, Co-Bipartite Graphs, b-Coloring, 16. Peace & justice, Computer Science - Computational Complexity, Graphs with Stability Number Two, 13. Climate action, Combinatorics (math.CO), Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: https://ri.conicet.gov.ar/bitstream/11336/18897/1/CONICET_Digital_Nro.22766.pdf
http://arxiv.org/abs/1310.8313
https://hal.science/hal-01102516v1
https://hal.science/hal-01102516v1/document
https://doi.org/10.1007/s00453-014-9921-5
https://dblp.uni-trier.de/db/journals/corr/corr1310.html#BonomoSSV13
https://hal.inria.fr/hal-00926924
https://lipn.univ-paris13.fr/~valenciapabon/papers/b-col-cobip.pdf
https://link.springer.com/content/pdf/10.1007%2Fs00453-014-9921-5.pdf
https://arxiv.org/pdf/1310.8313
https://hal.archives-ouvertes.fr/hal-01102516/document
https://128.84.21.199/abs/1310.8313?context=math.CO
https://arxiv.org/abs/1310.8313
https://arxiv.org/pdf/1310.8313
https://repositorio-qa.anid.cl/handle/10533/147921
http://hdl.handle.net/10533/147921
http://hdl.handle.net/11336/18897
https://hdl.handle.net/10533/147921

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

Autoren: Bonomo, Flavia Schaudt, Oliver Stein, Maya et al.

Schlagwörter: b-Coloring, Stability number two, Co-triangle-free graphs, NP-hardness, Treecographs, Polytime dynamic programming algorithms

Dateibeschreibung: application/pdf

Relation: Algorithmica Volumen: 73 Número: 2 oct 2015; https://repositorio.uchile.cl/handle/2250/135495

Verfügbarkeit: https://doi.org/10.1007/s00453-014-9921-5
https://repositorio.uchile.cl/handle/2250/135495

A Stronger Model of Dynamic Programming Algorithms.

Autoren: Buresh-Oppenheim, Joshua Davis, Sashka Impagliazzo, Russell

Quelle: Algorithmica; Aug2011, Vol. 60 Issue 4, p938-968, 31p, 1 Chart, 1 Graph

Schlagwörter: ALGORITHMS, DYNAMIC programming, MATHEMATICAL optimization, MATHEMATICAL programming, LINEAR programming

Genome-wide Association Analysis Reveals Loci Associated With Resistance Against Piscirickettsia Salmonis In Two Atlantic Salmon (salmo Salar L.) ChRomosomes ; Bmc Genomics

Autoren: Correa, K. Lhorente, JP Lopez, ME et al.

Schlagwörter: Ciencias Biológicas, Computer Science, Software Engineering, Mathematics, Applied, resistance, salmon, were, salmonis, atlantic, genetic, genome, Ciencias Naturales, B-coloring, Stability Number Two, Co-triangle-free Graphs, Np-hardness, Treecographs, Polytime Dynamic Programming Algorithms

Relation: instname: ANID; reponame: Repositorio Digital RI2.0; https://doi.org/10.1186/s12864-015-2038-7; PFB03; WOS:000360668100003; https://hdl.handle.net/10533/87816

Verfügbarkeit: https://hdl.handle.net/10533/87816
https://doi.org/10.1186/s12864-015-2038-7

Toward a Model for Backtracking and Dynamic Programming.

Autoren: Alekhnovich, Michael Borodin, Allan Buresh-Oppenheim, Joshua et al.

Quelle: Computational Complexity; Dec2011, Vol. 20 Issue 4, p679-740, 62p

Schlagwörter: DYNAMIC programming, ALGORITHMS, SPECTRUM analysis, SATISFIABILITY (Computer science), KNAPSACK problems

A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations.

Autoren: Blanc, Manon Bournez, Olivier

Quelle: International Journal of Foundations of Computer Science; Nov2025, Vol. 36 Issue 7, p989-1016, 28p

Schlagwörter: COMPUTABLE functions, COMPUTABLE analysis, ORDINARY differential equations, LINEAR differential equations, POLYNOMIAL time algorithms, MATHEMATICAL functions, COMPUTATIONAL complexity

School of MTIME-VARYING SEMIDEFINITE PROGRAMMING: PATH FOLLOWING A BURER MONTEIRO FACTORIZATION.

Autoren: BELLON, ANTONIO DRESSLER, MAREIKE KUNGURTSEV, VYACHESLAV et al.

Quelle: SIAM Journal on Optimization; 2024, Vol. 34 Issue 1, p1-26, 26p

Schlagwörter: TRACKING algorithms, SEMIDEFINITE programming, FACTORIZATION, ONLINE algorithms, INTERIOR-point methods, LOW-rank matrices, MATRIX decomposition

SIMPLIFICATION OF POLYLINE BUNDLES OF GRAPHS AND TREES.

Autoren: Bosch, Yannick Schäfer, Peter Spoerhase, Joachim et al.

Quelle: Journal of Computational Geometry; 2025, Vol. 16 Issue 1, p203-252, 50p

Schlagwörter: APPROXIMATION algorithms, NP-hard problems, PUBLIC transit, TREE graphs, COMPUTATIONAL complexity

Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization.

Autoren: Balcan, Maria-Florina Dick, Travis Sandholm, Tuomas et al.

Quelle: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-73, 73p

Schlagwörter: CONSTRAINT satisfaction, SEARCH algorithms, TREE size, GENERALIZATION, INTEGERS

Pandora's Problem with Combinatorial Cost.

Autoren: Berger, Ben Ezra, Tomer Feldman, Michal et al.

Quelle: Mathematics of Operations Research; Nov2025, Vol. 50 Issue 4, p3161-3189, 29p

Schlagwörter: COST functions, ECONOMIC models, COMPUTATIONAL complexity, INSPECTION & review

Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations.

Autoren: Elbassioni, Khaled

Quelle: Algorithmica; Dec2022, Vol. 84 Issue 12, p3622-3654, 33p

Schlagwörter: APPROXIMATION algorithms, CONVEX sets, LINEAR programming, ROBUST optimization

The [formula omitted]-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing.

Autoren: Ait-Ferhat, Dehia Juliard, Vincent Stauffer, Gautier et al.

Quelle: Operations Research Letters. Sep2020, Vol. 48 Issue 5, p652-657. 6p. 2 Charts.

Schlagwörter: *INTEGRATED circuits manufacturing, *DYNAMIC programming, *ALGORITHMS, GRAPH coloring, FOOD color, GRAPH algorithms

Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment.

Autoren: D'Emidio, Mattia Delfaraz, Esmaeil Di Stefano, Gabriele et al.

Quelle: Applied Sciences (2076-3417); Apr2024, Vol. 14 Issue 7, p2884, 22p

Schlagwörter: COMPUTER software testing, GRAPH algorithms, TELECOMMUNICATION systems, ALGORITHMS, SOFTWARE development tools, INFORMATION storage & retrieval systems

Geografische Kategorien: L'AQUILA (Italy)

Qualitative Reasoning about 2D Cardinal Directions using Answer Set Programming.

Autoren: Izmirlioglu, Yusuf Erdem, Esra

Quelle: Journal of Artificial Intelligence Research; 2023, Vol. 77, p1371-1453, 83p

Schlagwörter: BENCHMARKING (Management), DISCRETIZATION methods, COMPUTATIONAL complexity, DISJUNCTION (Logic), CONSTRAINT algorithms

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

Autoren: Bonomo, F. Schaudt, O. Stein, M. et al.

Schlagwörter: b-Coloring, Co-triangle-free graphs, NP-hardness, Polytime dynamic programming algorithms, Stability number two, Treecographs, Color, Coloring, Dynamic programming, Forestry, Graphic methods, Polynomial approximation, Stability, Trees (mathematics), Dynamic programming algorithm, Stability number, Triangle-free graphs, Graph theory

Relation: https://hdl.handle.net/20.500.12110/paper_01784617_v73_n2_p289_Bonomo

Verfügbarkeit: https://hdl.handle.net/20.500.12110/paper_01784617_v73_n2_p289_Bonomo

Minimum concave cost flow over a grid network.

Autoren: He, Qie Ahmed, Shabbir Nemhauser, George

Quelle: Mathematical Programming; Apr2015, Vol. 150 Issue 1, p79-98, 20p

Schlagwörter: POLYNOMIAL time algorithms, POLYHEDRA, DYNAMIC programming, COST functions, NP-hard problems

Bernoulli Factories and Black-box Reductions in Mechanism Design.

Autoren: DUGHMI, SHADDIN HARTLINE, JASON KLEINBERG, ROBERT D. et al.

Quelle: Journal of the ACM; Mar2021, Vol. 68 Issue 2, p1-30, 30p

Schlagwörter: INCENTIVE (Psychology), BERNOULLI equation, POLYNOMIAL time algorithms, FACTORIES, COINS

Combinatorial Optimization.

Quelle: Oberwolfach Reports; 2024, Vol. 21 Issue 4, p2949-2999, 51p

Schlagwörter: COMBINATORIAL optimization, ALGEBRAIC geometry, OPERATIONS research, APPLIED sciences, GROUP theory

A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines.

Autoren: Cohen, Ilan Reuven Cohen, Izack Zaks, Iyar

Quelle: Annals of Operations Research; Jul2024, Vol. 338 Issue 1, p429-452, 24p

Schlagwörter: CLOUD computing, POLYNOMIAL time algorithms, APPROXIMATION algorithms, EMPIRICAL research, MACHINERY, ECONOMIC lot size

Separation routine and extended formulations for the stable set problem in claw-free graphs.

Autoren: Faenza, Yuri Oriolo, Gianpaolo Stauffer, Gautier

Quelle: Mathematical Programming; Jul2021, Vol. 188 Issue 1, p53-84, 32p

Schlagwörter: COMBINATORIAL optimization, LINEAR programming, ALGORITHMS, POLYTOPES, MATHEMATICAL optimization, INTEGER programming

Geografische Kategorien: NEW York (State)