64 search results - page 1 / 13 » Algorithms for Secretary Problems on Graphs and Hypergraphs |
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
SIAMDM
2008
13 years 4 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
CAIP
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
ACL
1998
13 years 5 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...