Results 1  10
of
11
A Simple Approximation Algorithm for the Weighted Matching Problem
 Information Processing Letters
, 2003
"... We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7]. ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7].
BOB: Improved Winner Determination in Combinatorial Auctions and Generalizations
, 2003
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary or substitutable. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. T ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary or substitutable. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper presents a more sophisticated search algorithm for optimal (and anytime) winner determination, including structural improvements that reduce search tree size, faster data structures, and optimizations at search nodes based on driving toward, identifying and solving tractable special cases. We also uncover a more general tractable special case, and design algorithms for solving it as well as for solving known tractable special cases substantially faster. We generalize combinatorial auctions to multiple units of each item, to reserve prices on singletons as well as combinations, and to combinatorial exchanges. All of these generalizations support both complementarity and substitutability of the items. Finally, we present algorithms for determining the winners in these generalizations.
Maximum matchings in regular graphs of high girth, The Electronic
 Journal of Combinatorics
"... ..."
Contents lists available at SciVerse ScienceDirect Earth and Planetary Science Letters
"... journal homepage: www.elsevier.com/locate/epsl Holocene tropical South American hydroclimate revealed from a decadally resolved ..."
Abstract
 Add to MetaCart
journal homepage: www.elsevier.com/locate/epsl Holocene tropical South American hydroclimate revealed from a decadally resolved
Dynamic Matchings and Quasidynamic Fractional Matchings. II
"... Consider a directed graph G in which every edge has an associated realvalued distance and a realvalued weight. The weight of an undirected circuit of G is the sum of the weights of the edges, whereas the distance of an undirected circuit is the sum of the distances of the forward edges of the circ ..."
Abstract
 Add to MetaCart
Consider a directed graph G in which every edge has an associated realvalued distance and a realvalued weight. The weight of an undirected circuit of G is the sum of the weights of the edges, whereas the distance of an undirected circuit is the sum of the distances of the forward edges of the circuit minus the sum of the distances of the backward edges. A trivial circuit is a twoedge circuit in which one edge of G appears twice on the circuit. A quasidynamic fractional matching (or Qmatching) is a collection of vertexdisjoint circuits such that each circuit is either trivial or else it is an odd circuit whose distance is nonzero. The Qmatching problem is to find a Qmatching that maximizes the sum of the weights of its circuits. The Qmatching problem generalizes both the matching problem and the fractional matching problem. Moreover, the dynamic matching problem, which is a matching problem on an infinite dynamic (timeexpanded) graph, is linearly transformable to the Qmatching problem, as shown in Part I of this paper. In this paper we solve the Qmatching problem by generalizing Edmonds ' blossom algorithm. In fact, all of the major components of the blossom algorithmincluding alternating trees, augmentations, shrinking, and expandingare appropriately generalized to yield a running time that is proportional to that for the weighted matching problem. Furthermore, if all edge distances are equal to zero, this new algorithm reduces to the blossom algorithm. I.
Contents 10 Blossom Algorithms for 1Matching/Edge Covering Problems in Undirected Networks 669
"... ..."
Alternating Euler Paths for Packings and Covers
, 1975
"... walk " asks if the girls in an allgirl school can take a walk in twobytwo fashion so that each pair walking side by side are on friendly terms, it being known which pairs are friendly among all possible pairings. If such a utopian arrangement is not possible, then what is the largest number ..."
Abstract
 Add to MetaCart
walk " asks if the girls in an allgirl school can take a walk in twobytwo fashion so that each pair walking side by side are on friendly terms, it being known which pairs are friendly among all possible pairings. If such a utopian arrangement is not possible, then what is the largest number of friendly pairings that can be
Rapport n o RR200808KaiserRaspaud Conjecture on Cubic Graphs
"... A conjecture of Kaiser and Raspaud [6] asserts (in a special form due to Mácajová and Skoviera) that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a stronger result for tr ..."
Abstract
 Add to MetaCart
A conjecture of Kaiser and Raspaud [6] asserts (in a special form due to Mácajová and Skoviera) that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a stronger result for traceable graphs.
Discrete Applied Mathematics ( ) – Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics
"... journal homepage: www.elsevier.com/locate/dam A polyhedral study of the maximum edge subgraph problem ..."
Abstract
 Add to MetaCart
journal homepage: www.elsevier.com/locate/dam A polyhedral study of the maximum edge subgraph problem