Sciweavers

41 search results - page 4 / 9
» Hereditary Properties of Tournaments
Sort
View
ORL
2010
158views more  ORL 2010»
14 years 6 months ago
Constructing fair round robin tournaments with a minimum number of breaks
Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the ...
Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
WG
2001
Springer
15 years 4 months ago
(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele D...
FOCS
2009
IEEE
15 years 6 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
CONCUR
2005
Springer
15 years 5 months ago
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
Sibylle B. Fröschle, Slawomir Lasota
CORR
2010
Springer
176views Education» more  CORR 2010»
14 years 12 months ago
Sequential item pricing for unlimited supply
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
Maria-Florina Balcan, Florin Constantin