Symposium on Discrete Algorithms

Known as: Soda 
SODA, the Annual ACM-SIAM Symposium on Discrete Algorithms is an academic conference in the field of theoretical computer science. It is considered… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
Digital collections of data continue to grow exponentially as the information age continues to infiltrate every aspect of society… (More)
  • figure 2.1
  • table 3
  • table 4
  • figure 9
  • figure 10
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Geometric Approximation Algorithms: A Summary Based Approach by Sharathkumar Raghvendra Department of Computer Science, Duke… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
2010
2010
We show that any deterministic streaming algorithm that makes a constant number of passes over the input and gives a constant… (More)
Is this relevant?
2010
2010
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a… (More)
  • figure 1
Is this relevant?
2006
2006
We give a linear time recognition algorithm for circular-arc graphs. Our algorithm is much simpler than the linear time… (More)
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper considers the problem of determining the achievable rates in multi-hop wireless networks. We consider the problem of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We study approximation algorithms for placing replicated data in arbitrary networks. Consider a network of nodes with individual… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Abstract: In this paper, we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 9
Is this relevant?