1405 search results - page 85 / 281 » Popularity at Minimum Cost |
138
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
126
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
143
click to vote
ISAAC
2004
Springer
15 years 9 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...
152
Voted
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
112
Voted
ATAL
2004
Springer
15 years 9 months ago
2004
Springer
The bullwhip effect is the amplification of the order variability in a supply chain. This phenomenon causes important financial cost due to higher inventory levels and agility r...