Sciweavers

1480 search results - page 106 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
PODC
2005
ACM
14 years 4 months ago
Proof labeling schemes
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
Amos Korman, Shay Kutten, David Peleg
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 11 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 11 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
14 years 3 months ago
Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences
Optimizing the hypervolume indicator within evolutionary multiobjective optimizers has become popular in the last years. Recently, the indicator has been generalized to the weight...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 5 months ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...