1272 search results - page 72 / 255 » The Set Cover with Pairs Problem |
113
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
105
click to vote
IJON
2007
15 years 21 days ago
2007
Inspired by optical recordings from visual cortex which show maps of orientation selectivity, and the finding that very similar patterns of population activity occur when the neu...
125
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
90
Voted
EDBT
2006
ACM
16 years 28 days ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
92
Voted
TALG
2008
15 years 21 days ago
2008
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...