16404 search results - page 441 / 3281 » A set coverage problem |
211
click to vote
TCS
2008
15 years 6 months ago
2008
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
174
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
154
click to vote
ACISICIS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
149
click to vote
COCO
2007
Springer
16 years 28 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
199
click to vote
EPIA
2007
Springer
16 years 28 days ago
2007
Springer
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second tak...