Sciweavers

157 search results - page 4 / 32
» Frugal Colouring of Graphs
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
Beyond VCG: Frugality of Truthful Mechanisms
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ï¬...
Anna R. Karlin, David Kempe, Tami Tamir
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 9 months ago
Frugality in path auctions
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
Edith Elkind, Amit Sahai, Kenneth Steiglitz
WG
2007
Springer
14 years 1 months ago
Mixing 3-Colourings in Bipartite Graphs
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
WG
2005
Springer
14 years 1 months ago
Channel Assignment and Improper Choosability of Graphs
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
Frédéric Havet, Jean-Sébastie...
DM
2010
131views more  DM 2010»
13 years 7 months ago
On a construction of graphs with high chromatic capacity and large girth
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...
Bing Zhou