Sciweavers

219 search results - page 34 / 44
» Maximum common subgraph: some upper bound and lower bound re...
Sort
View
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 3 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 10 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 8 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
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
TCOM
2008
151views more  TCOM 2008»
13 years 8 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee