Sciweavers

287 search results - page 51 / 58
» Exact Cover with light
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
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...
Michel X. Goemans, David P. Williamson
JCT
2006
100views more  JCT 2006»
13 years 7 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
MICS
2010
128views more  MICS 2010»
13 years 2 months ago
Arrangements on Parametric Surfaces II: Concretizations and Applications
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...
Eric Berberich, Efi Fogel, Dan Halperin, Michael K...
ATAL
2011
Springer
12 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
CHI
2005
ACM
14 years 7 months ago
MusicCube: making digital music tangible
To some extent listening to digital music via storage devices has led to a loss of part of the physical experience associated with earlier media formats such as CDs and LPs. For e...
Miguel Bruns Alonso, David V. Keyson