UB Paderborn / Katalog / Suche / in CDI

Improved Approximation Algorithms for Minimum Weight Vertex Separators

SIAM journal on computing, 2008-01, Vol.38 (2), p.629-657

2008

Volltextzugriff (PDF)

Spectral techniques applied to sparse random graphs

Random structures & algorithms, 2005-09, Vol.27 (2), p.251-275

2005

Volltextzugriff (PDF)

Fair Shares: Feasibility, Domination, and Incentives

Mathematics of operations research, 2024-07

2024

Volltextzugriff (PDF)

A threshold of ln n for approximating set cover

Journal of the ACM, 1998-07, Vol.45 (4), p.634-652

Feige, Uriel

1998

Volltextzugriff (PDF)

On Maximizing Welfare When Utility Functions Are Subadditive

SIAM journal on computing, 2009-01, Vol.39 (1), p.122-142

Feige, Uriel

2009

Volltextzugriff (PDF)

How to Hide a Clique?

Theory of computing systems, 2024-04

2024

Volltextzugriff (PDF)

Target set selection for conservative populations

Discrete Applied Mathematics, 2021-12, Vol.305, p.119-132

2021

Volltextzugriff (PDF)

Genomic variability within an organism exposes its cell lineage tree

PLoS computational biology, 2005-10, Vol.1 (5), p.e50-e50

2005

Volltextzugriff (PDF)

On the path partition number of 6‐regular graphs

Journal of graph theory, 2022-11, Vol.101 (3), p.345-378

2022

Volltextzugriff (PDF)

Approximating the Bandwidth via Volume Respecting Embeddings

Journal of computer and system sciences, 2000-06, Vol.60 (3), p.510-539

Feige, Uriel

2000

Volltextzugriff (PDF)

A threshold of in n for approximating set cover

Journal of the ACM, 1998-07, Vol.45 (4), p.634

Feige, Uriel

1998

Volltextzugriff (PDF)

Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time

SIAM journal on computing, 2018-01, Vol.47 (3), p.755-768

2018

Volltextzugriff (PDF)

An improved approximation ratio for the minimum linear arrangement problem

Information processing letters, 2007-01, Vol.101 (1), p.26-29

2007

Volltextzugriff (PDF)

Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

SIAM journal on computing, 1999, Vol.29 (1), p.1-28

1999

Volltextzugriff (PDF)

Fair-Share Allocations for Agents with Arbitrary Entitlements

Mathematics of operations research, 2023-10

2023

Volltextzugriff (PDF)

The Ordered Covering Problem

Algorithmica, 2018-10, Vol.80 (10), p.2874-2908

2018

Volltextzugriff (PDF)

Shotgun assembly of random jigsaw puzzles

Random structures & algorithms, 2020-07, Vol.56 (4), p.998-1015

2020

Volltextzugriff (PDF)

Heuristic for Maximizing DNA Reuse in Synthetic DNA Library Assembly

ACS synthetic biology, 2014-08, Vol.3 (8), p.529-542

2014

Volltextzugriff (PDF)

CONTAGIOUS SETS IN RANDOM GRAPHS

The Annals of applied probability, 2017-10, Vol.27 (5), p.2675-2697

2017

Volltextzugriff (PDF)

Oblivious Algorithms for the Maximum Directed Cut Problem

Algorithmica, 2015-02, Vol.71 (2), p.409-428

2015

Volltextzugriff (PDF)

Optimization with Uniform Size Queries

Algorithmica, 2017-05, Vol.78 (1), p.255-273

2017

Volltextzugriff (PDF)

A tight lower bound on the cover time for random walks on graphs

Random structures & algorithms, 1995-07, Vol.6 (4), p.433-438

Feige, Uriel

1995

Volltextzugriff (PDF)

Approximate Modularity Revisited

SIAM journal on computing, 2020-01, Vol.49 (1), p.67-97

2020

Volltextzugriff (PDF)

MAXIMIZING NON-MONOTONE SUBMODULAR FUNCTIONS

SIAM journal on computing, 2011-01, Vol.40 (4), p.1133-1153

2011

Volltextzugriff (PDF)

Interactive proofs and the hardness of approximating cliques

Journal of the ACM, 1996-03, Vol.43 (2), p.268-292

1996

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Improved Approximation Algorithms for Minimum Weight Vertex Separators

Spectral techniques applied to sparse random graphs

Fair Shares: Feasibility, Domination, and Incentives

A threshold of ln n for approximating set cover

On Maximizing Welfare When Utility Functions Are Subadditive

How to Hide a Clique?

Target set selection for conservative populations

Genomic variability within an organism exposes its cell lineage tree

On the path partition number of 6‐regular graphs

Approximating the Bandwidth via Volume Respecting Embeddings

A threshold of in n for approximating set cover

Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time

An improved approximation ratio for the minimum linear arrangement problem

Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

Fair-Share Allocations for Agents with Arbitrary Entitlements

The Ordered Covering Problem

Shotgun assembly of random jigsaw puzzles

Heuristic for Maximizing DNA Reuse in Synthetic DNA Library Assembly

CONTAGIOUS SETS IN RANDOM GRAPHS

Oblivious Algorithms for the Maximum Directed Cut Problem

Optimization with Uniform Size Queries

A tight lower bound on the cover time for random walks on graphs

Approximate Modularity Revisited

MAXIMIZING NON-MONOTONE SUBMODULAR FUNCTIONS

Interactive proofs and the hardness of approximating cliques

Suchergebnisse filtern