Sciweavers

Share
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
8 years 1 days ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
8 years 1 days ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
GC
2011
Springer
9 years 4 months ago
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
Tao Jiang, Michael Salerno
ARSCOM
2004
76views more  ARSCOM 2004»
9 years 9 months ago
Independent sets in Steiner triple systems
A set of points in a Steiner triple system (STS(v)) is said to be independent if no three of these points occur in the same block. In this paper we derive for each k 8 a closed f...
A. D. Forbes, Mike J. Grannell, Terry S. Griggs
JGT
2007
85views more  JGT 2007»
9 years 9 months ago
On graphs with subgraphs having large independence numbers
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
Noga Alon, Benny Sudakov
JSAT
2006
94views more  JSAT 2006»
9 years 9 months ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
CORR
2008
Springer
100views Education» more  CORR 2008»
9 years 9 months ago
A note on regular Ramsey graphs
We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C n log n.
Noga Alon, Sonny Ben-Shimon, Michael Krivelevich
CORR
2010
Springer
100views Education» more  CORR 2010»
9 years 9 months ago
Shortest paths between shortest paths and independent sets
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
Marcin Kaminski, Paul Medvedev, Martin Milanic
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
9 years 11 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
APPROX
2008
Springer
94views Algorithms» more  APPROX 2008»
9 years 11 months ago
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
Eden Chlamtac, Gyanit Singh
books