1332 search results - page 123 / 267 » Combinatorial Algorithms |
MFCS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
RECOMB
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Emerging research demonstrates the potential of proteinprotein interaction (PPI) networks in uncovering the mechanistic bases of cancers, through identification of intera...
ESA
2007
Springer
14 years 3 months ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
SODA
1992
ACM
13 years 10 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...