English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Randomly Rounding Rationals with Cardinality Constraints and Derandomizations

Doerr, B. (2007). Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. In W. Thomas, & P. Weil (Eds.), STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science (pp. 441-452). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2072-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0023-F3FC-2
Genre: Conference Paper

Files

show Files
hide Files
:
stacs07_rand.pdf (Any fulltext), 5KB
 
File Permalink:
-
Name:
stacs07_rand.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Doerr, Benjamin1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We show how to generate randomized roundings of rational vectors that satisfy hard cardinality constraints and allow large deviations bounds. This improves and extends earlier results by Srinivasan (FOCS 2001), Gandhi et al. (FOCS 2002) and the author (STACS 2006). Roughly speaking, we show that also for rounding arbitrary rational vectors randomly or deterministically, it suffices to understand the problem for vectors (which typically is much easier). So far, this was only known for vectors with entries in , ℓ ∈ ℕ. To prove the general case, we exhibit a number of results of independent interest, in particular, a quite useful lemma on negatively correlated random variables, an extension of de Werra’s (RAIRO 1971) coloring result for unimodular hypergraphs and a sufficient condition for a unimodular hypergraph to have a perfectly balanced non-trivial partial coloring. We also show a new solution for the general derandomization problem for rational matrices.

Details

show
hide
Language(s): eng - English
 Dates: 2008-02-282007
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 356765
Other: Local-ID: C12573CC004A8E26-D8848493C4E2863DC1257257004FF38F-stacs07_rand
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Aachen, Germany
Start-/End Date: 2007-02-22 - 2007-02-24

Legal Case

show

Project information

show

Source 1

show
hide
Title: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science
Source Genre: Proceedings
 Creator(s):
Thomas, Wolfgang, Editor
Weil, Pascal, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 441 - 452 Identifier: ISBN: 3-540-70917-7

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -