✦ LIBER ✦

Integer models and upper bounds for the 3-club problem

✍ Scribed by Maria Teresa Almeida; Filipa D. Carvalho

Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 170 KB
Volume: 60
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.21455

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower and upper bounds for the degree-co

Lower and upper bounds for the degree-constrained minimum spanning tree problem

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

Integer programming models and algorithm

Integer programming models and algorithms for the graph decontamination problem with mobile agents

✍ John Penuel; J. Cole Smith; Siqian Shen 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 371 KB 👁 1 views

## Abstract This article considers the problem of using synchronous mobile agents to decontaminate the nodes of a graph given a spreading contamination. We begin by considering the problem of minimizing cleaning time, given initial agent, and contamination locations. Then, we take as input a set of

The critical-item, upper bounds, and a b

The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem

✍ Shaw, Dong X.; Cho, Geon 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

The tree knapsack problem (TKP) is a generalized 0-1 knapsack problem where all the items (nodes) are subjected to a partial ordering represented by a rooted tree. If a node is selected to be packed into the knapsack, then all the items on the path from the selected node to the root must also be pac

A 3D finite element method for the model

A 3D finite element method for the modelling of bounded and unbounded electromagnetic problems in the time domain

✍ W. P. Carpes Jr; L. Pichon; A. Razek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 3 views

This paper presents a 3D body-conforming "nite element solution of the time-dependent vector wave equation. The method uses edge elements on tetrahedra for the electric "eld interpolation. This kind of element is suited to model Maxwell's equations since it only enforces tangential continuity of vec

Tighter Lower Bounds for Nearest Neighbo

Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model

✍ Omer Barkol; Yuval Rabani 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao's cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a cell, and the search time. For example, suppose we

Retracted:Comments on ‘Upper bound solut

Retracted:Comments on ‘Upper bound solution to elasticity problems: A unique property of the linearly conforming point interpolation method (LC-PIM)’ by G. R. Liu and G. Y. Zhang, International Journal for Numerical Methods in Engineering, 2008

✍ J. P. Moitinho de Almeida 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 1 views

## Abstract The following article from __International Journal for Numerical Methods in Engineering__, Comments on ‘Upper bound solution to elasticity problems: A unique property of the linearly conforming point interpolation method (LC‐PIM)’ by G. R. Liu and G. Y. Zhang, published online on 19 Jun