Proceedings of 37th Conference on Foundations of Computer Science

14-16 Oct. 1996

Filter Results

Displaying Results 1 - 25 of 67
  • Proceedings of 37th Conference on Foundations of Computer Science

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (355 KB)
    Freely Available from IEEE
  • Approximate strip packing

    Publication Year: 1996, Page(s):31 - 36
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    We present an approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm finds a packing of n rectangles whose total height is within a factor of (1+/spl epsiv/) of optimal, and has running time polynomial both in n and in 1//spl epsiv/. It is based on a reduction to fractional bin-packi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • Factoring graphs to bound mixing rates

    Publication Year: 1996, Page(s):194 - 203
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    This paper develops a new technique for bounding the mixing rate of a Markov chain by decomposing the state space into factors. The first application is an efficient Monte Carlo Markov chain algorithm for generating random three-colorings of 2-dimensional lattice regions. This provides a rigorous tool for studying some properties of the 3-state Potts model and the ice model from statistical mechan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient self-testing/self-correction of linear recurrences

    Publication Year: 1996, Page(s):602 - 611
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    The authors consider the problem of designing self-testers/self-correctors for functions defined by linear recurrences. They present the first complete package of efficient and simple self-testers, self-correctors, and result-checkers for such functions. The results are proved by demonstrating an efficient reduction from this problem to the problem of testing linear functions over certain matrix g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic approximation of metric spaces and its algorithmic applications

    Publication Year: 1996, Page(s):184 - 193
    Cited by:  Papers (105)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    This paper provides a novel technique for the analysis of randomized algorithms for optimization problems on metric spaces, by relating the randomized performance ratio for any, metric space to the randomized performance ratio for a set of “simple” metric spaces. We define a notion of a set of metric spaces that probabilistically-approximates another metric space. We prove that any met... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An 8-approximation algorithm for the subset feedback vertex set problem

    Publication Year: 1996, Page(s):310 - 319
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    We present an 8-approximation algorithm for the problem of finding a minimum weight subset feedback vertex set. The input in this problem consists of an undirected graph G=(V,E) with vertex weights w(v) and a subset of vertices S called special vertices. A cycle is called interesting if it contains at least one special vertex. A subset of vertices is called a subset feedback vertex set with respec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal data compression and portfolio selection

    Publication Year: 1996, Page(s):534 - 538
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The authors consider universal data compression, universal portfolio selection (online portfolio algorithms) and the relationship of both to information theory. Apparently the fundamental minimax redundancy game in data compression and the minimax regret game for the growth rate of wealth in investment have the same answer. There is also a duality between entropy rate and the growth rate of wealth View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate checking of polynomials and functional equations

    Publication Year: 1996, Page(s):592 - 601
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    The authors show how to check programs that compute polynomials and functions defined by addition theorems-in the realistic setting where the output of the program is approximate instead of exact. They present results showing how to perform approximate checking, self-testing, and self-correcting of polynomials, settling in the affirmative a question raised by Gemmell et al. (1991), and Rubinfeld a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New coding techniques for improved bandwidth utilization

    Publication Year: 1996, Page(s):173 - 182
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    The introduction of parallel models that account for communication between processors has shown that interprocessor bandwidth is often the limiting factor in parallel computing. In this paper, we introduce a new coding technique for transmitting the XOR of carefully selected patterns of bits to be communicated which greatly reduces bandwidth requirements in some settings. This technique has broade... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clique is hard to approximate within n1-ϵ

    Publication Year: 1996, Page(s):627 - 636
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    The author proves that unless NP=coR, Max Clique is hard to approximate in polynomial time within a factor n1-ε for any ε>0. This is done by, for any δ>0, constructing a proof system for NP which uses δ amortized free bits. A central lemma, which might be of independent interest, gives sufficient conditions (in the form of a certain type of agreement) for cre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Short paths in expander graphs

    Publication Year: 1996, Page(s):86 - 95
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the inter-connection networks on which they run. We develop new routing algorithms and structural results for bounded-degree expander graphs. Our results are unified by the fact that they are all based upon, and extend, a body of work: asserting that expanders are rich in short, disjoint p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate option pricing

    Publication Year: 1996, Page(s):244 - 253
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    As increasingly large volumes of sophisticated options are traded in world financial markets, determining a “fair” price for these options has become an important and difficult computational problem. Many valuation codes use the binomial pricing model, in which the stock price is driven by a random walk. In this model, the value of an n-period option on a stock is the expected time-dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A 3-approximation for the minimum tree spanning k vertices

    Publication Year: 1996, Page(s):302 - 309
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    In this paper we give a 3-approximation algorithm for the problem of finding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximation algorithm for the minimum tour that visits any k-vertices View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Potential of the approximation method

    Publication Year: 1996, Page(s):431 - 440
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Developing some techniques for the approximation method, we establish precise versions of the following statements concerning lower bounds for circuits that detect cliques of size s in a graph with m vertices. For 5⩽s⩽m/4, a monotone circuit computing CLIQUE(m, s) contains at least (1/2) 1.8min(√s-12,m/(4s))/ gates. If a non-monotone circuit computes CLIQUE using a “... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant quantum computation

    Publication Year: 1996, Page(s):56 - 65
    Cited by:  Papers (51)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer making long computations impossible. A further dif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The geometry of coin-weighing problems

    Publication Year: 1996, Page(s):524 - 532
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Given a set of m coins out of a collection of coins of k unknown distinct weights, the authors wish to decide if all the m given coins have the same weight or not using the minimum possible number of weighings in a regular balance beam. Let m(n,k) denote the maximum possible number of coins for which the above problem can be solved in n weighings. They show that m(n,2)=n(½+o(1))n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerant data structures

    Publication Year: 1996, Page(s):580 - 589
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    The authors consider the tolerance of data structures to memory faults. They observe that many pointer-based data structures (e.g. linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a linked list or tree may result in the loss of the entire set of data. They present a formal framework for studying the fault tolerance properties of pointer-based data structures, and pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial time approximation schemes for Euclidean TSP and other geometric problems

    Publication Year: 1996, Page(s):2 - 11
    Cited by:  Papers (49)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    We present a polynomial time approximation scheme for Euclidean TSP in ℜ2. Given any n nodes in the plane and ε>0, the scheme finds a (1+ε)-approximation to the optimum traveling salesman tour in time n0(1/ε). When the nodes are in ℜd, the running time increases to n(O˜(logd-2n)/εd-1) The previous best appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum likelihood decoding of Reed Solomon codes

    Publication Year: 1996, Page(s):164 - 172
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    We present a randomized algorithm which takes as input n distinct points {(xi,yi)}i=1n from F×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable a of degree at most d which agree with the given set of points in at least t places (i.e., yi=f(xi) for at... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing and density dependent jump Markov processes

    Publication Year: 1996, Page(s):213 - 222
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following model: customers arrive as a Poisson stream of rate λn, λ<1, at a collection of n servers. Each customer chooses some constant d servers independently and uniformly at random from the n servers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gadgets, approximation, and linear programming

    Publication Year: 1996, Page(s):617 - 626
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    The authors present a linear-programming based method for finding “gadgets”, i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A key step in this method is a simple observation which limits the search space to a finite one. Using this new method they present a number of new, computer-constructed gadgets for several different redu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing permanents over fields of characteristic 3: where and why it becomes difficult

    Publication Year: 1996, Page(s):108 - 114
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    In this paper we consider the complexity of computing permanents over fields of characteristic 3. We present a polynomial time algorithm for computing per(A) for a matrix A such that the rank rg(AAT-I)⩽1. On the other hand, we show that existence of a polynomial-time algorithm for computing per(A) for a matrix A such that rg(AAT-I)⩾2 implies NP=R. As a byproduct we ob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimal path-matching problem

    Publication Year: 1996, Page(s):78 - 85
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we present results implying the polynomial-time solvability of the two problems. We also use our results to give the first strongly polynomial separation algorithm for the convex hull of matchable sets of a graph, and the first polynomial-time algorithm to compute the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

    Publication Year: 1996, Page(s):21 - 30
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satisfies any linear inequality, then with high probability, the new matching satisfies that linear inequality in an approximate sense. This extends the well-known LP rounding procedure of Raghavan and Thompson (1987), which is usually used to round fractional so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.