Search Sciweavers | Sciweavers

2957 search results - page 115 / 592

» The Complexity of Polynomial-Time Approximation

click to vote

WG
2007
Springer

141views Theoretical Computer Science» more WG 2007»

Complexity and Approximation Results for the Connected Vertex Cover Problem

14 years 4 months ago

Download www.lamsade.dauphine.fr

We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...

Bruno Escoffier, Laurent Gourvès, Jé...

claim paper

Read More »

click to vote

STOC
2002
ACM

105views Algorithms» more STOC 2002»

Approximating the smallest grammar: Kolmogorov complexity in natural models

14 years 10 months ago

Download www.cs.princeton.edu

Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...

claim paper

Read More »

click to vote

CGI
1998
IEEE

153views Computer Graphics» more CGI 1998»

Fast Approximate Quantitative Visibility for Complex Scenes

14 years 2 months ago

Download www.cs.ucy.ac.cy

Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...

Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...

claim paper

Read More »

click to vote

STOC
2002
ACM

119views Algorithms» more STOC 2002»

The complexity of approximating entropy

14 years 10 months ago