SODA

2012

ACM

12 years 15 days ago
2012

ACM

The Densest k-subgraph problem (i.e. ﬁnd a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a signiﬁcant g...

JAIR

2002

13 years 9 months ago
2002

In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...

JSAT

2006

13 years 10 months ago
2006

An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...

JAIR

2006

13 years 10 months ago
2006

We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...

FOCS

2008

IEEE

13 years 11 months ago
2008

IEEE

We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...

COCOA

2008

Springer

13 years 12 months ago
2008

Springer

We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...

AAAI

2008

14 years 12 days ago
2008

The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...

LATIN

2004

Springer

14 years 3 months ago
2004

Springer

Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...