1933 search results - page 87 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
104
Voted
DM
2010
15 years 3 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
145
Voted
JPDC
2008
15 years 3 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
167
Voted
ICNC
2009
Springer
15 years 8 months ago
2009
Springer
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
118
Voted
MOR
2006
15 years 3 months ago
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
152
Voted
ECIR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. As retrieval systems become more complex, learning to rank approaches are being developed to automatically tune their parameters. Using online learning to rank approaches...