Sciweavers

723 search results - page 138 / 145
» On the hyperbolicity constant in graphs
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
FOCS
2007
IEEE
14 years 1 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
LADC
2007
Springer
14 years 1 months ago
Connectivity in Eventually Quiescent Dynamic Distributed Systems
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...
Sara Tucci Piergiovanni, Roberto Baldoni
ICPP
2006
IEEE
14 years 1 months ago
Data-Flow Analysis for MPI Programs
Message passing via MPI is widely used in singleprogram, multiple-data (SPMD) parallel programs. Existing data-flow frameworks do not model the semantics of message-passing SPMD ...
Michelle Mills Strout, Barbara Kreaseck, Paul D. H...
WIOPT
2006
IEEE
14 years 1 months ago
Color-based broadcasting for ad hoc networks
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...