2976 search results - page 248 / 596 » On the bounded integer programming |
138
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
147
click to vote
ORDER
2006
15 years 5 months ago
2006
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
115
Voted
ENDM
2002
15 years 4 months ago
2002
Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...
145
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
127
click to vote
MP
2008
15 years 5 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...