Sciweavers

2694 search results - page 66 / 539
» Frege's New Science
Sort
View
WG
2009
Springer
15 years 6 months ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle
DIS
2009
Springer
15 years 6 months ago
Linear Programming Boosting by Column and Row Generation
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
Kohei Hatano, Eiji Takimoto
FOCS
2007
IEEE
15 years 6 months ago
On the Advantage over Random for Maximum Acyclic Subgraph
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
Moses Charikar, Konstantin Makarychev, Yury Makary...
FOCS
2007
IEEE
15 years 6 months ago
Pseudorandom Bits for Polynomials
We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain th...
Andrej Bogdanov, Emanuele Viola
GI
2007
Springer
15 years 6 months ago
The Collaborative Carrier Vehicle Routing Problem for Capacitated Traveling Salesman Tours
Abstract: This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a picku...
Susanne Berger, Christian Bierwirth