Sciweavers

Share
DISOPT
2008
82views more  DISOPT 2008»
9 years 1 months ago
Note on pseudolattices, lattices and submodular linear programs
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
Ulrich Faigle, Britta Peis
DM
2010
108views more  DM 2010»
9 years 1 months ago
Grundy number and products of graphs
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
Marie Asté, Frédéric Havet, C...
CORR
2008
Springer
110views Education» more  CORR 2008»
9 years 1 months ago
Finding Dense Subgraphs in G(n,1/2)
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
Atish Das Sarma, Amit Deshpande, Ravi Kannan
CORR
2010
Springer
125views Education» more  CORR 2010»
9 years 1 months ago
Near-Optimal Bayesian Active Learning with Noisy Observations
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
Daniel Golovin, Andreas Krause, Debajyoti Ray
ARSCOM
2008
119views more  ARSCOM 2008»
9 years 1 months ago
Greedy Defining Sets in Latin Squares
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...
Manouchehr Zaker
AOR
2007
69views more  AOR 2007»
9 years 1 months ago
The Greedy Algorithm for the Symmetric TSP
We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and answered a question in Gutin and Yeo, Oper. Res. Lett. 30 (2002), 97–99.
Gregory Gutin, Anders Yeo
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
9 years 1 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
FOCS
2008
IEEE
9 years 2 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
ATAL
2010
Springer
9 years 2 months ago
The multi variable multi constrained distributed constraint optimization framework
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
Christopher Portway, Edmund H. Durfee
IPCO
1992
100views Optimization» more  IPCO 1992»
9 years 2 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
books