494 search results - page 47 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—In social news services, selecting valuable and credible news content is one of the most important issues. In traditional journalism, a small number of people called editors sel...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
RANDOM
1998
Springer
14 years 9 hour ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...