840 search results - page 106 / 168 » Inapproximability of Combinatorial Optimization Problems |
155
click to vote
COCOA
2009
Springer
16 years 18 days ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
162
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
185
click to vote
ISSAC
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
165
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
175
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...