Výsledky vyhledávání - "Polynomial-Time Approximation Algorithm"

Better Coloring of 3-Colorable Graphs

Autoři: Ken-ichi Kawarabayashi Mikkel Thorup Hirotaka Yoneda a další

Přispěvatelé: Ken-ichi Kawarabayashi Mikkel Thorup Hirotaka Yoneda a další

Zdroj: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :331-339

Témata: FOS: Computer and information sciences, polynomial time approximation algorithm, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), G.2.2, 3-colorable, Graph coloring

Popis souboru: application/pdf

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

Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs

Autoři: Nguyen, Trung Thanh Rothe, Jörg Trung Thanh Nguyen and Jörg Rothe

Přispěvatelé: Nguyen, Trung Thanh Rothe, Jörg Trung Thanh Nguyen and Jörg Rothe

Témata: bi-criteria approximation algorithm, polynomial-time approximation algorithm, load balancing, machine scheduling

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.14

Dostupnost: https://doi.org/10.4230/LIPIcs.ISAAC.2020.14
https://nbn-resolving.org/urn:nbn:de:0030-drops-133582
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.14

Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications

Autoři: Liu, Qingyu

Thesis Advisors: Electrical and Computer Engineering, Zeng, Haibo, Yang, Yaling, Rakha, Hesham A., Hsiao, Michael S., Park, Jung-Min

Témata: Delay-Aware Network Flow, Delay-Aware Multi-Path Routing, Multi-Hop Network, Network Resource Allocation, Polynomial-Time Approximation Algorithm

Popis souboru: ETD; application/pdf

Dostupnost: http://hdl.handle.net/10919/90405

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

Autoři: Darties, Benoit Giroudeau, Rodolphe König, Jean-Claude a další

Přispěvatelé: Darties, Benoit Giroudeau, Rodolphe König, Jean-Claude a další

Zdroj: RAIRO - Operations Research. 50:781-795

Témata: Coupled-task scheduling model, FOS: Computer and information sciences, Computer Science - Computational Complexity, Polynomial-time approximation algorithm, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Data Structures and Algorithms (cs.DS), Complexity, 02 engineering and technology, Computational Complexity (cs.CC)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1706.02214
http://arxiv.org/abs/1706.02214
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01533981
https://hal-lirmm.ccsd.cnrs.fr/hal-01533981v1
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01533981/document
https://www.rairo-ro.org/articles/ro/abs/2016/04/ro151132/ro151132.html
http://www.rairo-ro.org/articles/ro/pdf/2016/04/ro151132.pdf
https://arxiv.org/abs/1706.02214
https://www.arxiv.org/pdf/1706.02214
https://www.arxiv.org/abs/1706.02214
http://ui.adsabs.harvard.edu/abs/2017arXiv170602214D/abstract
https://ube.hal.science/hal-01533981v1/document
https://doi.org/10.1051/ro/2016034
https://ube.hal.science/hal-01533981v1

Control traffic balancing in software defined networks

Autoři: Lin, Shih-Chun Wang, Pu Luo, Min

Zdroj: Computer Networks. 106:260-271

Témata: Control traffic balancing, Traffic statistic, Software defined networks, Polynomial-time approximation algorithm, In-band control, 0202 electrical engineering, electronic engineering, information engineering, Optimal controller location, 02 engineering and technology

Přístupová URL adresa: https://dl.acm.org/doi/10.1016/j.comnet.2015.08.004
https://soar.wichita.edu/handle/10057/12467
https://www.sciencedirect.com/science/article/abs/pii/S1389128615002571
https://dblp.uni-trier.de/db/journals/cn/cn106.html#LinWL16a
https://core.ac.uk/display/59225687
https://doi.org/10.1016/j.comnet.2015.08.004

Performance Debugging of Real-Time Systems Using Multicriteria Schedulability Analysis

Autoři: Unmesh D. Bordoloi Samarjit Chakraborty

Zdroj: 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07). :193-202

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, NP-hard problems, fixed-function components, fully-programmable processors, hardware accelerators, multicriteria schedulability analysis problem, partially-programmable engines, polynomial-time approximation algorithm, real-time systems debugging, computational complexity, embedded systems, performance evaluation, processor scheduling, program debugging, 01 natural sciences, ddc

Přístupová URL adresa: https://mediatum.ub.tum.de/1163359

Differential approximation algorithms for some combinatorial optimization problems

Autoři: Demange, Marc Grisoni, Pascal Paschos, Vangelis

Zdroj: Theoretical Computer Science. 209:107-122

Témata: Polynomial time approximation algorithm, polynomial time approximation algorithm, 0211 other engineering and technologies, set covering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Set covering, NP-complete problem, Bin-packing, Coloring, Parallel algorithms in computer science, Recherche opérationnelle, coloring, bin-packing, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://basepub.dauphine.fr/handle/123456789/2901
https://dblp.uni-trier.de/db/journals/tcs/tcs209.html#DemangeGP98
https://www.sciencedirect.com/science/article/pii/S0304397597000996
http://www.sciencedirect.com/science/article/pii/S0304397597000996

Fast approximation algorithms for job scheduling with processing set restrictions

Autoři: Joseph Y.-T. Leung Yumei Huo

Zdroj: Theoretical Computer Science. 411:3947-3955

Témata: Nested processing set, Tree-hierarchical processing set, Makespan minimization, Polynomial-time approximation algorithm, 0211 other engineering and technologies, Nonpreemptive scheduling, Inclusive processing set, 0102 computer and information sciences, 02 engineering and technology, NP-hard, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/tcs/tcs411.html#HuoL10
http://www.sciencedirect.com/science/article/pii/S0304397510004251
https://core.ac.uk/display/82723081
https://researchwith.njit.edu/en/publications/fast-approximation-algorithms-for-job-scheduling-with-processing-
https://www.sciencedirect.com/science/article/pii/S0304397510004251
https://doi.org/10.1016/j.tcs.2010.08.008

A randomized algorithm for determining dominating sets in graphs of maximum degree five

Autoři: Hanaa A. E. Essa Soheir M. Khamis Sameh S. Daoud

Zdroj: Theoretical Computer Science. 410:5122-5127

Témata: Randomized algorithm, Minimum dominating set, Polynomial-time approximation algorithm, 0211 other engineering and technologies, Las Vegas technique, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/tcs/tcs410.html#KhamisDE09
https://www.sciencedirect.com/science/article/pii/S0304397509005866
http://research.asu.edu.eg/bitstream/123456789/1122/1/A%20randomized%20algorithm%20for%20determining%20dominating%20sets%20in%20graphs%20of.pdf
https://core.ac.uk/display/82497506
http://www.sciencedirect.com/science/article/pii/S0304397509005866
http://research.asu.edu.eg/handle/123456789/1122

Improved Approximation Algorithms for MAX $$\frac{n}{{\text{2}}}$$ -DIRECTED-BISECTION and MAX $$\frac{n}{{\text{2}}}$$ -DENSE-SUBGRAPH: Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH

Autoři: Jiye Han Liping Zhang Zheng-Hai Huang a další

Zdroj: Journal of Global Optimization. 27:399-410

Témata: Polynomial-time approximation algorithm, 0211 other engineering and technologies, Semidefinite programming, max \(\frac{n}2\)-dense-subgraph, 0102 computer and information sciences, 02 engineering and technology, max \(\frac{n}2\)-directed-bisection, Semi-infinite programming, Approximation methods and heuristics in mathematical programming, 01 natural sciences, Approximation algorithms

Popis souboru: application/xml

A .699-approximation algorithm for Max-Bisection: A .699-approximation algorithm for Max-Bisection.

Autoři: Yinyu Ye

Zdroj: Mathematical Programming. 90:101-111

Témata: Combinatorial optimization, Discrete approximations in optimal control, polynomial-time approximation algorithm, 0211 other engineering and technologies, Semidefinite programming, 0102 computer and information sciences, 02 engineering and technology, semidefinite programming, 01 natural sciences, Approximation algorithms, graph bisection

Popis souboru: application/xml

Approximations for Steiner Trees with Minimum Number of Steiner Points: Approximations for Steiner trees with minimum number of Steiner points

Autoři: Guoliang Xue Ding-Zhu Du Guohui Lin a další

Zdroj: Journal of Global Optimization. 18:17-33

Témata: polynomial time approximation algorithm, VLSI design, Steiner trees, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences, Approximation algorithms, Theoretical Computer Science, Discrete location and assignment, division multiplexing optical network design, wavelength, wireless communications, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), Graph theory (including graph drawing) in computer science, WDM optical networks, 0202 electrical engineering, electronic engineering, information engineering, Steiner tree problem, approximation algorithms, approximation algorithm, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1580039
https://doi.org/10.1023/a:1008384012064
https://www.sciencedirect.com/science/article/pii/S0304397500001821
https://www.sciencedirect.com/science/article/abs/pii/S0304397500001821
https://doi.org/10.1016/S0304-3975(00)00182-1
https://asu.pure.elsevier.com/en/publications/approximations-for-steiner-trees-with-minimum-number-of-steiner-p
https://dblp.uni-trier.de/db/journals/tcs/tcs262.html#ChenDHLWX01
https://link.springer.com/article/10.1023%2FA%3A1008384012064
http://optimization.asu.edu/papers/JOGO2000-RelayNode.pdf
https://dblp.uni-trier.de/db/journals/jgo/jgo18.html#ChenDHLWX00
https://dl.acm.org/doi/10.1023/A%3A1008384012064

Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems

Autoři: Marc Demange Vangelis Th. Paschos

Zdroj: RAIRO - Operations Research. 33:481-507

Témata: Combinatorial optimization, polynomial time approximation algorithm, bin packing, NP-complete problem, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, complexity, covering, 01 natural sciences, coloring

Popis souboru: application/xml

Přístupová URL adresa: http://dblp.uni-trier.de/db/journals/rairo/rairo33.html#DemangeP99
https://www.cambridge.org/core/journals/rairo-operations-research/article/asymptotic-differential-approximation-ratio-definitions-motivations-and-application-to-some-combinatorial-problems/E13D42C388FF07BEE4A5610E3EFF52A3
https://eudml.org/doc/105201
https://dblp.uni-trier.de/db/journals/rairo/rairo33.html#DemangeP99
https://www.rairo-ro.org/articles/ro/abs/1999/04/ro1999334p481/ro1999334p481.html
http://www.rairo-ro.org/articles/ro/pdf/1999/04/ro1999334p481.pdf

Maximum renamable Horn sub-CNFs

Autoři: Endre Boros

Zdroj: Discrete Applied Mathematics. :29-40

Témata: polynomial time approximation algorithm, Applied Mathematics, 0211 other engineering and technologies, Horn CNF, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Horn sub-CNF, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Satisfiability, 01 natural sciences, Approximation algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1389862
https://doi.org/10.1016/s0166-218x(99)00031-1
https://www.sciencedirect.com/science/article/abs/pii/S0166218X99000311
https://dblp.uni-trier.de/db/journals/dam/dam96.html#Boros99
https://www.sciencedirect.com/science/article/pii/S0166218X99000311

An 0.828-approximation algorithm for the uncapacitated facility location problem: An 0. 828-approximation algorithm for the uncapacitated facility location problem

Autoři: Alexander A. Ageev Maxim Sviridenko

Zdroj: Discrete Applied Mathematics. 93:149-156

Témata: Applied Mathematics, satisfiability problem, polynomial-time approximation algorithm, 0211 other engineering and technologies, Performance guarantee, performance guarantee, 0102 computer and information sciences, 02 engineering and technology, Approximation algorithm, 01 natural sciences, Discrete location and assignment, uncapacitated facility location, Facility location, Discrete Mathematics and Combinatorics, Satisfiability problem

Popis souboru: application/xml

Přístupová URL adresa: http://www.sciencedirect.com/science/article/pii/S0166218X99001031
https://dl.acm.org/doi/10.1016/S0166-218X%2899%2900103-1
https://www.sciencedirect.com/science/article/pii/S0166218X99001031
https://dblp.uni-trier.de/db/journals/dam/dam93.html#AgeevS99

Approximation Algorithms for Quadratic Programming: Approximation algorithms for quadratic programming

Autoři: Fu, Minyue Luo, Z. Q. Yu, Y. a další

Přispěvatelé: Fu, Minyue Luo, Z. Q. Yu, Y. a další

Zdroj: Journal of Combinatorial Optimization. 2:29-50

Témata: polynomial-time approximation algorithm, 0211 other engineering and technologies, quadratic programming, 02 engineering and technology, Quadratic programming, 0101 mathematics, global minimizer, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1154641
https://doi.org/10.1023/a:1009739827008
https://dblp.uni-trier.de/db/journals/jco/jco2.html#FuLY98
http://dblp.uni-trier.de/db/journals/jco/jco2.html#FuLY98
https://link.springer.com/article/10.1023/A%3A1009739827008
https://experts.umn.edu/en/publications/approximation-algorithms-for-quadratic-programming

The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems

Autoři: Demange, Marc Paschos, Vangelis Université Paris 1 a další

Přispěvatelé: Demange, Marc Paschos, Vangelis Université Paris 1 a další

Zdroj: Computational Optimization and Applications. 7:307-324

Témata: Convex programming, Combinatorial optimization, polynomial time approximation algorithm, 0211 other engineering and technologies, quadratic programming, 02 engineering and technology, Programming involving graphs or networks, Quadratic programming, independent set, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), NP-complete problem, vertex covering, quadratic programming as subproblem, polynomial time \(\rho\)-approximation algorithm, Abstract computational complexity for mathematical programming problems, Recherche opérationnelle

Popis souboru: application/xml

Přístupová URL adresa: https://basepub.dauphine.fr/handle/123456789/2774
https://rd.springer.com/article/10.1023/A%3A1008660812834
https://dblp.uni-trier.de/db/journals/coap/coap7.html#DemangeP97
https://link.springer.com/article/10.1023%2FA%3A1008660812834

On some approximation problems concerning sparse polynomials over finite fields

Autoři: Igor E. Shparlinski Marek Karpinski

Zdroj: Theoretical Computer Science. 157:259-266

Témata: lower bounds, polynomial time approximation algorithm, 0102 computer and information sciences, Parallel algorithms in computer science, 0101 mathematics, 01 natural sciences, Polynomials over finite fields, Number-theoretic algorithms, complexity, number of non-zeros of sparse polynomials, Theoretical Computer Science, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://dl.acm.org/doi/10.1016/0304-3975%2895%2900162-X
https://www.sciencedirect.com/science/article/pii/030439759500162X
https://researchers.mq.edu.au/en/publications/on-some-approximation-problems-concerning-sparse-polynomials-over
https://dblp.uni-trier.de/db/journals/tcs/tcs157.html#KarpinskiS96

Average case analysis of greedy algorithms for optimisation problems on set systems

Autoři: Fernandez de la Vega, Wenceslas Blot, Joël Paschos, Vangelis a další

Zdroj: Theoretical Computer Science. 147:267-298

Témata: polynomial time approximation algorithm, 0211 other engineering and technologies, set covering, 0102 computer and information sciences, 02 engineering and technology, Analyse, 01 natural sciences, average case approximation, Theoretical Computer Science, hitting set, greedy algorithms, NP-complete problem, hypergraph independent set, Parallel algorithms in computer science, Computer Science(all)

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://zbmath.org/985012
https://doi.org/10.1016/0304-3975(95)00242-o

Approximation results for the minimum graph coloring problem

Autoři: Paschos, Vangelis Grisoni, Pascal Demange, Marc

Zdroj: Information Processing Letters. 50:19-23

Témata: polynomial time approximation algorithm, Polynomial approximation, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, minimum vertex coloring problem, 01 natural sciences, Combinatorial problems, Computational complexity, Graph theory (including graph drawing) in computer science, Analysis of algorithms, differential approximation ratio, Recherche opérationnelle

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/561608
https://doi.org/10.1016/0020-0190(94)90039-6
https://dblp.uni-trier.de/db/journals/ipl/ipl50.html#DemangeGP94
https://www.sciencedirect.com/science/article/abs/pii/0020019094900396
http://www.sciencedirect.com/science/article/pii/0020019094900396
https://basepub.dauphine.fr/handle/123456789/2905