1054 search results - page 78 / 211 » Capacitated Domination Problem |
116
click to vote
MJ
2007
15 years 2 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
126
click to vote
TALG
2010
15 years 1 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
152
click to vote
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
129
click to vote
SMA
2008
ACM
15 years 3 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
139
Voted
WADS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...