Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleOctober 2013
An Improved Competitive Algorithm for Reordering Buffer Management
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 1–10https://doi.org/10.1109/FOCS.2013.9We give an Õ(log log k)-competitive randomized online algorithm for reordering buffer management, where k is the buffer size. Our bound matches the lower bound of Adamaszek et al. (STOC 2011). Our algorithm has two stages which are executed online in ...
- ArticleOctober 2013
The Parity of Directed Hamiltonian Cycles
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 727–735https://doi.org/10.1109/FOCS.2013.83We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619n) time and polynomial space. For bipartite graphs, we give a 1.5npoly(n) expected time algorithm. Our ...
- ArticleOctober 2013
Approximating Minimization Diagrams and Generalized Proximity Search
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 717–726https://doi.org/10.1109/FOCS.2013.82We investigate the classes of functions whose minimization diagrams can be approximated efficiently in Red. We present a general framework and a data-structure that can be used to approximate the minimization diagram of such functions. The resulting ...
- ArticleOctober 2013
A Linear Time Approximation Scheme for Euclidean TSP
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 698–706https://doi.org/10.1109/FOCS.2013.80The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. The special case of TSP in bounded-dimensional Euclidean spaces has been a particular focus of research: The celebrated results of Arora and Mitchell - along ...
- ArticleOctober 2013
The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 638–647https://doi.org/10.1109/FOCS.2013.74We consider broadcast network design games in undirected networks in which every player is a node wishing to receive communication from a distinguished source node s and the cost of each communication link is equally shared among the downstream ...
-
- ArticleOctober 2013
Explicit Subspace Designs
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 608–617https://doi.org/10.1109/FOCS.2013.71A subspace design is a collection H_1, H_2, ·, H_M of subspaces of F_qm with the property that no low-dimensional subspace W of F_qm intersects too many subspaces of the collection. Subspace designs were introduced by Guru swami and Xing (STOC 2013) who ...
- ArticleOctober 2013
Improved Average-Case Lower Bounds for DeMorgan Formula Size
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 588–597https://doi.org/10.1109/FOCS.2013.69We give an explicit function h:0, 1nto0, 1 such that every deMorgan formula of size n3-o(1)/r2 agrees with h on at most a fraction of 12+2-Ω(r) of the inputs. This improves the previous average-case lower bound of Komargodski and Raz (STOC, 2013). Our ...
- ArticleOctober 2013
Arithmetic Circuits: A Chasm at Depth Three
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 578–587https://doi.org/10.1109/FOCS.2013.68We show that, over Q, if an n-variate polynomial of degree d = nO(1) is computable by an arithmetic circuit of size s (respectively by an arithmetic branching program of size s) then it can also be computed by a depth three circuit (i.e. a Sigma Pi ...
- ArticleOctober 2013
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 568–577https://doi.org/10.1109/FOCS.2013.67In the node-weighted prize-collecting Steiner tree problem we are given an undirected graph G=(V, E), non-negative costs c(v) and penalties π(v) for each v in V. The goal is to find a tree T that minimizes the total cost of the vertices spanned by T plus ...
- ArticleOctober 2013
Fully Dynamic (1+ e)-Approximate Matchings
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 548–557https://doi.org/10.1109/FOCS.2013.65We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sub linear time per update. Our main result is a data structure that maintains a (1+ý) approximation of maximum ...
- ArticleOctober 2013
Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 509–518https://doi.org/10.1109/FOCS.2013.61One of the most natural optimization problems is the k-Set Packing problem, where given a family of sets of size at most k one should select a maximum size subfamily of pair wise disjoint sets. A special case of 3-Set Packing is the well known 3-...
- ArticleOctober 2013
An O(c^k n) 5-Approximation Algorithm for Treewidth
- Hans L. Bodlaender,
- Pål Grønås Drange,
- Markus S. Dregi,
- Fedor V. Fomin,
- Daniel Lokshtanov,
- Michal Pilipczuk
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 499–508https://doi.org/10.1109/FOCS.2013.60We give an algorithm that for an input n-vertex graph G and integer k > 0, in time O(ck n) either outputs that the tree width of G is larger than k, or gives a tree decomposition of G of width at most 5k + 4. This is the first algorithm providing a ...
- ArticleOctober 2013
Strong Backdoors to Bounded Treewidth SAT
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 489–498https://doi.org/10.1109/FOCS.2013.59There are various approaches to exploiting "hidden structure" in instances of hard combinatorial problems to allow faster algorithms than for general unstructured or random instances. For SAT and its counting version #SAT, hidden structure has been ...
- ArticleOctober 2013
Playing Non-linear Games with Linear Oracles
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 420–428https://doi.org/10.1109/FOCS.2013.52Linear optimization is many times algorithmically simpler than non-linear convex optimization. Linear optimization over matroid polytopes, matching polytopes and path polytopes are example of problems for which we have efficient combinatorial algorithms,...
- ArticleOctober 2013
Approximation Schemes for Maximum Weight Independent Set of Rectangles
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 400–409https://doi.org/10.1109/FOCS.2013.50In the Maximum Weight Independent Set of Rectangles (MWISR) problem we are given a set of n axis-parallel rectangles in the 2D-plane, and the goal is to select a maximum weight subset of pair wise non-overlapping rectangles. Due to many applications, ...
- ArticleOctober 2013
- ArticleOctober 2013
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 370–379https://doi.org/10.1109/FOCS.2013.47We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the sub exponential-time inapproximability of the independent set problem, a question studied in the area of parameterized ...
- ArticleOctober 2013
The Complexity of Approximating Vertex Expansion
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 360–369https://doi.org/10.1109/FOCS.2013.46We study the complexity of approximating the vertex expansion of graphs G = (V, E), defined as φV def = minSCV n . |N(S)|/(|S| |V\ S). We give a simple polynomialtime algorithm for finding a subset with vertex expansion O(&root;φVlog d) where d is the ...
- ArticleOctober 2013
Approximate Constraint Satisfaction Requires Large LP Relaxations
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 350–359https://doi.org/10.1109/FOCS.2013.45We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful as programs ...
- ArticleOctober 2013
PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 340–349https://doi.org/10.1109/FOCS.2013.44We develop new techniques to incorporate the recently proposed "short code" (a low-degree version of the long code) into the construction and analysis of PCPs in the classical "Label Cover + Fourier Analysis" framework. As a result, we obtain more size-...