Search results

The discipline of [[combinatorial topology]] used combinatorial concepts in topology and in the early 20th century this turned into the fie ...exity theory|complexity problems]] in [[decision tree|linear decision tree algorithms]] and the [[Aanderaa–Karp–Rosenberg conjecture]]. Other areas include [[Pos ...

'''Algorithms and Combinatorics''' ({{ISSN|0937-5511}}) is a [[book series]] in mathemati *''Geometric Algorithms and Combinatorial Optimization'' ([[Martin Grötschel]], [[László Lovász]], and [[Alexander Sc ...

{{Short description|Combinatorial analog of the Borsuk-Ulam theorem}} In [[mathematics]], '''Tucker's lemma''' is a [[combinatorics|combinatorial]] analog of the [[Borsuk–Ulam theorem]], named after [[Albert W. Tuck ...

...nce between strongly- and weakly-polynomial time is when the inputs to the algorithms consist of integer or rational numbers. It is particularly common in [[Opti Some algorithms run in polynomial time in one model but not in the other one. For example: ...

[[Category:Combinatorial optimization]] [[Category:Approximation algorithms]] ...

...esman Problem: A Case Study in Local Optimization |journal=Local Search in Combinatorial Optimization |date=1997 |volume=1 |citeseerx=10.1.1.92.1635 }}</ref> [[Category:Approximation algorithms]] ...

{{Short description|Concept in combinatorial game theory}} In [[combinatorial game theory]], and particularly in the theory of [[impartial game]]s in [[m ...

...10.1016/0097-3165(72)90007-6 | mr=0299574 | year=1972 | journal=Journal of Combinatorial Theory, Series A | issn=1096-0899 | volume=13 | issue=1 | pages=40–54| doi- [[Category:Combinatorial algorithms]] ...

...'. Parameter words can be composed, to produce smaller subcubes of a given combinatorial cube. They have applications in [[Ramsey theory]] and in computer science i ...led its dimension. A one-dimensional combinatorial cube may be called a '''combinatorial line'''.{{r|lnka}} ...

...st3=Schapira | authorlink2=Noam Nisan | title=Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders | journal=[[Mathematics of Operations [[Category:Combinatorial optimization]] ...

...complexity depends on the precise shape of <math>P</math>, not just on its combinatorial structure. For instance, [[regular polygon]]s with <math>n</math> sides hav ...w extension complexity, this could potentially be used to devise efficient algorithms for the problem, using [[linear programming]] on its extended formulation. ...

[[Category:Combinatorial optimization]] [[Category:Combinatorial algorithms]] ...

==Combinatorial representation== | journal = Journal of Algorithms ...

The '''weapon target assignment problem''' ('''WTA''') is a class of [[combinatorial optimization]] problems present in the fields of [[Optimization (mathematic == Algorithms and generalizations == ...

...converge to solution very fast.{{sfn | Wang | Han | 2015 | p=11}} For the algorithms that are sublinear in space (e.g., counting the distinct elements of a stre ...=Leslie G. | last3=Vazirani | first3=Vijay V. | title=Random generation of combinatorial structures from a uniform distribution | journal=Theoretical Computer Scien ...

...the inputs to a problem that, when present, lead to good performance from algorithms on those inputs.{{r|pareto}} It can also bound the size of the output for s | title = 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany ...

...theory considerably extends anabelian geometry. Its main aim to construct algorithms which produce the curve, up to an isomorphism, from the étale fundamental g ==Combinatorial anabelian geometry== ...

...th the maximum possible weight. These problems generalize many problems in combinatorial optimization including finding [[maximum matching]]s and [[maximum weight m | title = Combinatorial structures and their applications (Proc. 1969 Calgary Conference) ...

...imensional constrained Delaunay and constrained regular triangulations. I. Combinatorial properties ==Algorithms== ...

{{Short description|Combinatorial optimization graph problem}} In mathematics, the '''minimum {{mvar|k}}-cut''' is a [[combinatorial optimization]] problem that requires finding a set of edges whose removal w ...