144 search results - page 18 / 29 » Algorithms for the Hypergraph and the Minor Crossing Number ... |
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
ML
2008
ACM
13 years 8 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
ALGORITHMICA
2010
13 years 8 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
ICTAI
2010
IEEE
13 years 6 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...