Results 1  10
of
122
MultiCut alphabetaPruning in GameTree Search
, 1999
"... The efficiency of the ##algorithm as a minimax search procedure can be attributed to its effective pruning at socalled cutnodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cutnodes by also expa ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The efficiency of the ##algorithm as a minimax search procedure can be attributed to its effective pruning at socalled cutnodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cutnodes by also
MultiCut αβPruning in GameTree Search
 Theoretical Computer Science
, 2001
"... Abstract. The efficiency of the αβalgorithm as a minimax search procedure can be attributed to its effective pruning at socalled cutnodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cutnodes by ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. The efficiency of the αβalgorithm as a minimax search procedure can be attributed to its effective pruning at socalled cutnodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cutnodes
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 432 (18 self)
 Add to MetaCart
The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have
Rounding algorithms for a geometric embedding of minimum multiway cut
 In STOC ’99: Proceedings of the 31st Annual ACM Symposium on Theory of Computing
, 1999
"... Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or kway, cut is a subset of the edges whose removal disconnects each terminal from the others. The multiway cut problem is to find a minimumcost multiway cut. This problem is MaxSNP hard. Recently ..."
Abstract

Cited by 50 (2 self)
 Add to MetaCart
and the value of the minimum multicut (the socalled integrality gap of the relaxation). For k = 3, we show the integrality gap is 12/11, giving tight upper and lower bounds. That is, we exhibit a graph with integrality gap 12/11 and give an algorithm that finds a cut of value 12/11 times the relaxation value
Approximating Clique and Biclique Problems
, 1998
"... We present here 2approximation algorithms for several node deletion and edge deletion biclique problems and for an edge deletion clique problem. The biclique problem is to find a node induced subgraph that is bipartite and complete. The objective is to minimize the total weight of nodes or edges de ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
of formulations introduced by Hochbaum. All approximation algorithms described Žand the polynomial algorithms for two versions of the node biclique problem. involve calls to a minimum cut algorithm. One conclusion of our analysis of the NPhard problems here is that all of these problems are MAX SNP
Costefficient network synthesis from leased lines
, 1997
"... Given a communication demand between each pair of nodes of a network we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes. The feasible capacities that can b ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
be leased from a network provider are of a particular kind in our case. There are a few socalled basic capacities having the property that every basic capacity is an integral multiple of every smaller basic capacity. An edge can be equipped with a capacity only if it is an integer combination of the basic
Nodecapacitated ring routing
, 2001
"... We consider the nodecapacitated routing problem in an undirected ring network along with its fractional relaxation, the nodecapacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
that there exists such a flow if and only if the socalled distance inequality holds for every choice of distance functions arising from nonnegative nodeweigths. For rings this (straightforward) result will be improved in two ways. We prove that, independent of the integrality of nodecapacities, it suffices
Enhanced Forward Pruning
, 2004
"... In this paper forwardpruning methods, such as multicut and null move, are tested at socalled ALL nodes. We improved the Principal Variation Search by four small but essential additions. The new PVS algorithm guarantees that forward pruning is safe at ALL nodes. Experiments show that multicut at ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper forwardpruning methods, such as multicut and null move, are tested at socalled ALL nodes. We improved the Principal Variation Search by four small but essential additions. The new PVS algorithm guarantees that forward pruning is safe at ALL nodes. Experiments show that multicut
CommunicationEfficient Parallel Algorithms for Distributed RandomAccess Machines
 Algorithmica
, 1988
"... This paper introduces a model for parallel computation, called the distributed randomaccess machine (DRAM), in which the communication requirements of parallel algorithms can be evaluated. A DRAM is an abstraction of a parallel computer in which memory accesses are implemented by routing messages ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
of a DRAM. We give a simple lemma that shows how to "shortcut" pointers in a data structure so that remote processors can communicate without causing undue congestion. We give O(lg n)step, linearprocessor, linearspace, conservative algorithms for a variety of problems on n node trees
MATLAB Application Program interface guide
 RAIRO Oper. Res
, 1998
"... Abstract. We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of socalled geometrical cuts to be added to the subpr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of socalled geometrical cuts to be added
Results 1  10
of
122