217 search results - page 22 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
125
click to vote
AMOST
2007
ACM
15 years 3 months ago
2007
ACM
We have devised a novel technique to automatically generate test cases for a software system, combining black-box model-based testing with white-box parameterized unit testing. Th...
WEA
2009
Springer
15 years 6 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
EWSN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
161
click to vote
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...