2976 search results - page 380 / 596 » On the bounded integer programming |
135
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
155
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
Parameterization is an effective technique for building flexible, reusable software. When dealing with parameterized components, an important concern is the time at which parame...
125
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
157
click to vote
WINE
2005
Springer
15 years 10 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
136
click to vote
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Several optimization techniques are hindered by uncertainties about the control flow in a program, which can generally not be determined by static methods at compile time. We pres...